pgrouting →
3.6.0-2 →
armhf → 2023-11-28 05:59:02
sbuild (Debian sbuild) 0.85.0 (04 January 2023) on test2023
+==============================================================================+
| pgrouting 3.6.0-2 (armhf) Tue, 28 Nov 2023 05:45:01 +0000 |
+==============================================================================+
Package: pgrouting
Version: 3.6.0-2
Source Version: 3.6.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-544119b5-9bd0-4236-83ea-11d36f27579c' with '<<CHROOT>>'
I: NOTICE: Log filtering will replace 'build/pgrouting-G8LArj/resolver-OqSZRI' 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.3 MB]
Get:3 http://172.17.4.1/private trixie-staging/main armhf Packages [14.9 MB]
Fetched 29.2 MB in 5s (5503 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: 'pgrouting' packaging is maintained in the 'Git' version control system at:
https://salsa.debian.org/debian-gis-team/pgrouting.git
Please use:
git clone https://salsa.debian.org/debian-gis-team/pgrouting.git
to retrieve the latest (possibly unreleased) updates to the package.
Need to get 3891 kB of source archives.
Get:1 http://172.17.4.1/private trixie-staging/main pgrouting 3.6.0-2 (dsc) [2528 B]
Get:2 http://172.17.4.1/private trixie-staging/main pgrouting 3.6.0-2 (tar) [3871 kB]
Get:3 http://172.17.4.1/private trixie-staging/main pgrouting 3.6.0-2 (diff) [16.9 kB]
Fetched 3891 kB in 1s (7692 kB/s)
Download complete and in download only mode
I: NOTICE: Log filtering will replace 'build/pgrouting-G8LArj/pgrouting-3.6.0' with '<<PKGBUILDDIR>>'
I: NOTICE: Log filtering will replace 'build/pgrouting-G8LArj' with '<<BUILDDIR>>'
+------------------------------------------------------------------------------+
| Install package build dependencies |
+------------------------------------------------------------------------------+
Setup apt archive
-----------------
Merged Build-Depends: cmake (>= 3.2), debhelper-compat (= 13), dh-sequence-sphinxdoc, graphviz, libboost-graph-dev, libjs-mathjax, postgis, postgresql-server-dev-all, python3-sphinx (>= 1.8), rdfind, build-essential, fakeroot
Filtered Build-Depends: cmake (>= 3.2), debhelper-compat (= 13), dh-sequence-sphinxdoc, graphviz, libboost-graph-dev, libjs-mathjax, postgis, postgresql-server-dev-all, python3-sphinx (>= 1.8), rdfind, 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 [770 B]
Get:5 copy:/<<RESOLVERDIR>>/apt_archive ./ Packages [802 B]
Fetched 2181 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 clang-16 cmake cmake-data debhelper dh-autoreconf
dh-strip-nondeterminism docutils-common dpkg-dev dwz file fontconfig
fontconfig-config fonts-dejavu-core fonts-dejavu-mono fonts-mathjax
gdal-data gdal-plugins gettext gettext-base graphviz groff-base icu-devtools
intltool-debian libabsl20220623 libaec0 libaom3 libarchive-zip-perl
libarchive13 libarmadillo12 libarpack2 libavif16 libblas3 libblkid1
libblosc1 libboost-graph-dev libboost-graph1.74-dev libboost-graph1.74.0
libboost-regex1.74-dev libboost-regex1.74.0 libboost-serialization1.74-dev
libboost-serialization1.74.0 libboost-test1.74-dev libboost-test1.74.0
libboost1.74-dev libbrotli1 libbsd0 libcairo2 libcdt5 libcfitsio10
libcgraph6 libclang-common-16-dev libclang-cpp16 libclang1-16
libcurl3-gnutls libcurl4 libdatrie1 libdav1d7 libde265-0 libdebhelper-perl
libdeflate0 libdpkg-perl libedit2 libelf1 libexpat1 libffi-dev
libfile-stripnondeterminism-perl libfontconfig1 libfreetype6 libfreexl1
libfribidi0 libfyba0 libgav1-1 libgc1 libgd3 libgdal34 libgeos-c1v5
libgeos3.12.1 libgeotiff5 libgfortran5 libgif7 libglib2.0-0 libgraphite2-3
libgts-0.7-5 libgvc6 libgvpr2 libharfbuzz0b libhdf4-0-alt libhdf5-103-1
libhdf5-hl-100 libheif-plugin-dav1d libheif-plugin-libde265 libheif1 libice6
libicu-dev libicu72 libjbig0 libjpeg62-turbo libjs-jquery libjs-mathjax
libjs-sphinxdoc libjs-underscore libjson-c5 libjson-perl libjsoncpp25
libkmlbase1 libkmldom1 libkmlengine1 liblab-gamut1 liblapack3 liblcms2-2
liblerc4 libllvm16 libltdl7 libmagic-mgc libmagic1 libmariadb3 libminizip1
libmount1 libncurses-dev libncurses6 libnetcdf19 libnghttp2-14 libnspr4
libnss3 libobjc-12-dev libobjc4 libodbc2 libodbcinst2 libogdi4.1
libopenjp2-7 libpango-1.0-0 libpangocairo-1.0-0 libpangoft2-1.0-0
libpathplan4 libpfm4 libpipeline1 libpixman-1-0 libpng16-16 libpoppler126
libpq-dev libpq5 libproc2-0 libproj25 libpsl5 libpython3-stdlib
libpython3.11-minimal libpython3.11-stdlib libqhull-r8.0 librav1e0 librhash0
librtmp1 librttopo1 libsharpyuv0 libsm6 libsmartcols1 libsnappy1v5
libspatialite8 libssh2-1 libssl-dev libsub-override-perl libsuperlu6
libsvtav1enc1d1 libsz2 libthai-data libthai0 libtiff6 libtool libuchardet0
liburiparser1 libuuid1 libuv1 libwebp7 libx11-6 libx11-data libxau6 libxaw7
libxcb-render0 libxcb-shm0 libxcb1 libxdmcp6 libxerces-c3.2 libxext6 libxml2
libxml2-dev libxmu6 libxpm4 libxrender1 libxt6 libyaml-0-2 libyuv0 libz3-4
libz3-dev llvm-16 llvm-16-dev llvm-16-linker-tools llvm-16-runtime
llvm-16-tools m4 man-db mariadb-common media-types mount mysql-common
netbase openssl po-debconf postgis postgresql-client-16
postgresql-client-common postgresql-common postgresql-server-dev-16
postgresql-server-dev-all procps proj-data python-babel-localedata python3
python3-alabaster python3-babel python3-certifi python3-chardet
python3-charset-normalizer python3-distutils python3-docutils python3-idna
python3-imagesize python3-jinja2 python3-lib2to3 python3-markupsafe
python3-minimal python3-packaging python3-pkg-resources python3-pygments
python3-requests python3-roman python3-six python3-snowballstemmer
python3-sphinx python3-tz python3-urllib3 python3-yaml python3.11
python3.11-minimal rdfind sensible-utils sgml-base sphinx-common ssl-cert
ucf unixodbc-common util-linux x11-common xml-core
Suggested packages:
autoconf-archive gnu-standards autoconf-doc clang-16-doc wasi-libc cmake-doc
cmake-format elpa-cmake-mode ninja-build dh-make debian-keyring gettext-doc
libasprintf-dev libgettextpo-dev gsfonts graphviz-doc groff lrzip
libboost1.74-doc libboost-atomic1.74-dev libboost-chrono1.74-dev
libboost-container1.74-dev libboost-context1.74-dev
libboost-contract1.74-dev libboost-coroutine1.74-dev
libboost-date-time1.74-dev libboost-exception1.74-dev libboost-fiber1.74-dev
libboost-filesystem1.74-dev libboost-graph-parallel1.74-dev
libboost-iostreams1.74-dev libboost-locale1.74-dev libboost-log1.74-dev
libboost-math1.74-dev libboost-mpi1.74-dev libboost-mpi-python1.74-dev
libboost-numpy1.74-dev libboost-program-options1.74-dev
libboost-python1.74-dev libboost-random1.74-dev libboost-stacktrace1.74-dev
libboost-system1.74-dev libboost-thread1.74-dev libboost-timer1.74-dev
libboost-type-erasure1.74-dev libboost-wave1.74-dev libboost1.74-tools-dev
libmpfrc++-dev libntl-dev libboost-nowide1.74-dev git bzr libgd-tools
geotiff-bin gdal-bin libgeotiff-epsg low-memory-monitor libhdf4-doc
libhdf4-alt-dev hdf4-tools libheif-plugin-ffmpegdec libheif-plugin-jpegdec
libheif-plugin-jpegenc libheif-plugin-j2kdec libheif-plugin-j2kenc
libheif-plugin-rav1e libheif-plugin-svtenc icu-doc fonts-mathjax-extras
fonts-stix libjs-mathjax-doc liblcms2-utils cryptsetup-bin ncurses-doc
odbc-postgresql tdsodbc ogdi-bin postgresql-doc-16 proj-bin libssl-doc
libtool-doc gfortran | fortran95-compiler gcj-jdk pkg-config llvm-16-doc
m4-doc apparmor less www-browser nfs-common libmail-box-perl postgresql-16
python3-doc python3-tk python3-venv python-charset-normalizer-doc
docutils-doc fonts-linuxlibertine | ttf-linux-libertine texlive-lang-french
texlive-latex-base texlive-latex-recommended python-jinja2-doc
python3-setuptools python-pygments-doc ttf-bitstream-vera
python3-cryptography python3-openssl python3-socks python-requests-doc
python3-stemmer dvipng fonts-freefont-otf imagemagick-6.q16 latexmk
python3-sphinx-rtd-theme sphinx-doc tex-gyre texlive-fonts-recommended
texlive-latex-extra texlive-plain-generic python3-brotli python3.11-venv
python3.11-doc binfmt-support sgml-base-doc dosfstools kbd util-linux-extra
util-linux-locales
Recommended packages:
libalgorithm-merge-perl curl | wget | lynx fonts-liberation2
libclang-rt-16-dev libfile-fcntllock-perl libarchive-cpio-perl proj-bin
libglib2.0-data shared-mime-info xdg-user-dirs libgts-bin
libheif-plugin-aomenc libheif-plugin-x265 javascript-common libjson-xs-perl
libgpm2 poppler-data publicsuffix libltdl-dev uuid-runtime binfmt-support
| systemd libmail-sendmail-perl postgresql-postgis postgis-doc logrotate
psmisc libpaper-utils python3-pil
The following NEW packages will be installed:
autoconf automake autopoint autotools-dev bsdextrautils ca-certificates
clang-16 cmake cmake-data debhelper dh-autoreconf dh-strip-nondeterminism
docutils-common dwz file fontconfig fontconfig-config fonts-dejavu-core
fonts-dejavu-mono fonts-mathjax gdal-data gdal-plugins gettext gettext-base
graphviz groff-base icu-devtools intltool-debian libabsl20220623 libaec0
libaom3 libarchive-zip-perl libarchive13 libarmadillo12 libarpack2 libavif16
libblas3 libblosc1 libboost-graph-dev libboost-graph1.74-dev
libboost-graph1.74.0 libboost-regex1.74-dev libboost-regex1.74.0
libboost-serialization1.74-dev libboost-serialization1.74.0
libboost-test1.74-dev libboost-test1.74.0 libboost1.74-dev libbrotli1
libbsd0 libcairo2 libcdt5 libcfitsio10 libcgraph6 libclang-common-16-dev
libclang-cpp16 libclang1-16 libcurl3-gnutls libcurl4 libdatrie1 libdav1d7
libde265-0 libdebhelper-perl libdeflate0 libedit2 libelf1 libexpat1
libffi-dev libfile-stripnondeterminism-perl libfontconfig1 libfreetype6
libfreexl1 libfribidi0 libfyba0 libgav1-1 libgc1 libgd3 libgdal34
libgeos-c1v5 libgeos3.12.1 libgeotiff5 libgfortran5 libgif7 libglib2.0-0
libgraphite2-3 libgts-0.7-5 libgvc6 libgvpr2 libharfbuzz0b libhdf4-0-alt
libhdf5-103-1 libhdf5-hl-100 libheif-plugin-dav1d libheif-plugin-libde265
libheif1 libice6 libicu-dev libicu72 libjbig0 libjpeg62-turbo libjs-jquery
libjs-mathjax libjs-sphinxdoc libjs-underscore libjson-c5 libjson-perl
libjsoncpp25 libkmlbase1 libkmldom1 libkmlengine1 liblab-gamut1 liblapack3
liblcms2-2 liblerc4 libllvm16 libltdl7 libmagic-mgc libmagic1 libmariadb3
libminizip1 libncurses-dev libncurses6 libnetcdf19 libnghttp2-14 libnspr4
libnss3 libobjc-12-dev libobjc4 libodbc2 libodbcinst2 libogdi4.1
libopenjp2-7 libpango-1.0-0 libpangocairo-1.0-0 libpangoft2-1.0-0
libpathplan4 libpfm4 libpipeline1 libpixman-1-0 libpng16-16 libpoppler126
libpq-dev libpq5 libproc2-0 libproj25 libpsl5 libpython3-stdlib
libpython3.11-minimal libpython3.11-stdlib libqhull-r8.0 librav1e0 librhash0
librtmp1 librttopo1 libsharpyuv0 libsm6 libsnappy1v5 libspatialite8
libssh2-1 libssl-dev libsub-override-perl libsuperlu6 libsvtav1enc1d1 libsz2
libthai-data libthai0 libtiff6 libtool libuchardet0 liburiparser1 libuv1
libwebp7 libx11-6 libx11-data libxau6 libxaw7 libxcb-render0 libxcb-shm0
libxcb1 libxdmcp6 libxerces-c3.2 libxext6 libxml2 libxml2-dev libxmu6
libxpm4 libxrender1 libxt6 libyaml-0-2 libyuv0 libz3-4 libz3-dev llvm-16
llvm-16-dev llvm-16-linker-tools llvm-16-runtime llvm-16-tools m4 man-db
mariadb-common media-types mysql-common netbase openssl po-debconf postgis
postgresql-client-16 postgresql-client-common postgresql-common
postgresql-server-dev-16 postgresql-server-dev-all procps proj-data
python-babel-localedata python3 python3-alabaster python3-babel
python3-certifi python3-chardet python3-charset-normalizer python3-distutils
python3-docutils python3-idna python3-imagesize python3-jinja2
python3-lib2to3 python3-markupsafe python3-minimal python3-packaging
python3-pkg-resources python3-pygments python3-requests python3-roman
python3-six python3-snowballstemmer python3-sphinx python3-tz
python3-urllib3 python3-yaml python3.11 python3.11-minimal rdfind
sbuild-build-depends-main-dummy sensible-utils sgml-base sphinx-common
ssl-cert ucf unixodbc-common x11-common xml-core
The following packages will be upgraded:
bsdutils dpkg-dev libblkid1 libdpkg-perl libmount1 libsmartcols1 libuuid1
mount util-linux
9 upgraded, 251 newly installed, 0 to remove and 24 not upgraded.
1 not fully installed or removed.
Need to get 237 MB/239 MB of archives.
After this operation, 1257 MB of additional disk space will be used.
Get:1 copy:/<<RESOLVERDIR>>/apt_archive ./ sbuild-build-depends-main-dummy 0.invalid.0 [972 B]
Get:2 http://172.17.4.1/private trixie-staging/main armhf mount armhf 2.39.2-6 [134 kB]
Get:3 http://172.17.4.1/private trixie-staging/main armhf bsdutils armhf 1:2.39.2-6 [86.5 kB]
Get:4 http://172.17.4.1/private trixie-staging/main armhf util-linux armhf 2.39.2-6 [1110 kB]
Get:5 http://172.17.4.1/private trixie-staging/main armhf libjson-perl all 4.10000-1 [87.5 kB]
Get:6 http://172.17.4.1/private trixie-staging/main armhf netbase all 6.4 [12.8 kB]
Get:7 http://172.17.4.1/private trixie-staging/main armhf postgresql-client-common all 256 [36.4 kB]
Get:8 http://172.17.4.1/private trixie-staging/main armhf openssl armhf 3.0.11-1 [1367 kB]
Get:9 http://172.17.4.1/private trixie-staging/main armhf ssl-cert all 1.1.2 [21.1 kB]
Get:10 http://172.17.4.1/private trixie-staging/main armhf sensible-utils all 0.0.20 [19.3 kB]
Get:11 http://172.17.4.1/private trixie-staging/main armhf ucf all 3.0043+nmu1 [55.2 kB]
Get:12 http://172.17.4.1/private trixie-staging/main armhf postgresql-common all 256 [180 kB]
Get:13 http://172.17.4.1/private trixie-staging/main armhf libpython3.11-minimal armhf 3.11.6-3 [800 kB]
Get:14 http://172.17.4.1/private trixie-staging/main armhf libexpat1 armhf 2.5.0-2 [76.8 kB]
Get:15 http://172.17.4.1/private trixie-staging/main armhf python3.11-minimal armhf 3.11.6-3 [1674 kB]
Get:16 http://172.17.4.1/private trixie-staging/main armhf python3-minimal armhf 3.11.4-5 [26.2 kB]
Get:17 http://172.17.4.1/private trixie-staging/main armhf media-types all 10.1.0 [26.9 kB]
Get:18 http://172.17.4.1/private trixie-staging/main armhf libuuid1 armhf 2.39.2-6 [28.1 kB]
Get:19 http://172.17.4.1/private trixie-staging/main armhf libpython3.11-stdlib armhf 3.11.6-3 [1679 kB]
Get:20 http://172.17.4.1/private trixie-staging/main armhf python3.11 armhf 3.11.6-3 [586 kB]
Get:21 http://172.17.4.1/private trixie-staging/main armhf libpython3-stdlib armhf 3.11.4-5 [9200 B]
Get:22 http://172.17.4.1/private trixie-staging/main armhf python3 armhf 3.11.4-5 [26.2 kB]
Get:23 http://172.17.4.1/private trixie-staging/main armhf sgml-base all 1.31 [15.4 kB]
Get:24 http://172.17.4.1/private trixie-staging/main armhf libblkid1 armhf 2.39.2-6 [145 kB]
Get:25 http://172.17.4.1/private trixie-staging/main armhf libmount1 armhf 2.39.2-6 [167 kB]
Get:26 http://172.17.4.1/private trixie-staging/main armhf libsmartcols1 armhf 2.39.2-6 [102 kB]
Get:27 http://172.17.4.1/private trixie-staging/main armhf libuchardet0 armhf 0.0.7-1 [65.0 kB]
Get:28 http://172.17.4.1/private trixie-staging/main armhf groff-base armhf 1.23.0-3 [1033 kB]
Get:29 http://172.17.4.1/private trixie-staging/main armhf bsdextrautils armhf 2.39.2-6 [81.2 kB]
Get:30 http://172.17.4.1/private trixie-staging/main armhf libpipeline1 armhf 1.5.7-1 [33.4 kB]
Get:31 http://172.17.4.1/private trixie-staging/main armhf man-db armhf 2.12.0-1 [1358 kB]
Get:32 http://172.17.4.1/private trixie-staging/main armhf libproc2-0 armhf 2:4.0.4-2 [54.9 kB]
Get:33 http://172.17.4.1/private trixie-staging/main armhf procps armhf 2:4.0.4-2 [848 kB]
Get:34 http://172.17.4.1/private trixie-staging/main armhf ca-certificates all 20230311 [153 kB]
Get:35 http://172.17.4.1/private trixie-staging/main armhf libmagic-mgc armhf 1:5.45-2 [314 kB]
Get:36 http://172.17.4.1/private trixie-staging/main armhf libmagic1 armhf 1:5.45-2 [96.1 kB]
Get:37 http://172.17.4.1/private trixie-staging/main armhf file armhf 1:5.45-2 [41.6 kB]
Get:38 http://172.17.4.1/private trixie-staging/main armhf gettext-base armhf 0.21-13 [156 kB]
Get:39 http://172.17.4.1/private trixie-staging/main armhf m4 armhf 1.4.19-4 [256 kB]
Get:40 http://172.17.4.1/private trixie-staging/main armhf autoconf all 2.71-3 [332 kB]
Get:41 http://172.17.4.1/private trixie-staging/main armhf autotools-dev all 20220109.1 [51.6 kB]
Get:42 http://172.17.4.1/private trixie-staging/main armhf automake all 1:1.16.5-1.3 [823 kB]
Get:43 http://172.17.4.1/private trixie-staging/main armhf autopoint all 0.21-13 [496 kB]
Get:44 http://172.17.4.1/private trixie-staging/main armhf libbsd0 armhf 0.11.7-4 [111 kB]
Get:45 http://172.17.4.1/private trixie-staging/main armhf libedit2 armhf 3.1-20230828-1 [76.0 kB]
Get:46 http://172.17.4.1/private trixie-staging/main armhf libicu72 armhf 72.1-4 [9009 kB]
Get:47 http://172.17.4.1/private trixie-staging/main armhf libxml2 armhf 2.9.14+dfsg-1.3 [571 kB]
Get:48 http://172.17.4.1/private trixie-staging/main armhf libz3-4 armhf 4.8.12-3.1 [5797 kB]
Get:49 http://172.17.4.1/private trixie-staging/main armhf libllvm16 armhf 1:16.0.6-15+rpi1 [20.7 MB]
Get:50 http://172.17.4.1/private trixie-staging/main armhf libclang-cpp16 armhf 1:16.0.6-15+rpi1 [9929 kB]
Get:51 http://172.17.4.1/private trixie-staging/main armhf libgc1 armhf 1:8.2.4-1 [231 kB]
Get:52 http://172.17.4.1/private trixie-staging/main armhf libobjc4 armhf 13.2.0-5+rpi1 [33.8 kB]
Get:53 http://172.17.4.1/private trixie-staging/main armhf libobjc-12-dev armhf 12.3.0-10+rpi1 [159 kB]
Get:54 http://172.17.4.1/private trixie-staging/main armhf libclang-common-16-dev all 1:16.0.6-15+rpi1 [656 kB]
Get:55 http://172.17.4.1/private trixie-staging/main armhf llvm-16-linker-tools armhf 1:16.0.6-15+rpi1 [1021 kB]
Get:56 http://172.17.4.1/private trixie-staging/main armhf libclang1-16 armhf 1:16.0.6-15+rpi1 [5584 kB]
Get:57 http://172.17.4.1/private trixie-staging/main armhf clang-16 armhf 1:16.0.6-15+rpi1 [104 kB]
Get:58 http://172.17.4.1/private trixie-staging/main armhf libarchive13 armhf 3.7.2-1 [294 kB]
Get:59 http://172.17.4.1/private trixie-staging/main armhf libbrotli1 armhf 1.1.0-2 [280 kB]
Get:60 http://172.17.4.1/private trixie-staging/main armhf libnghttp2-14 armhf 1.58.0-1 [61.7 kB]
Get:61 http://172.17.4.1/private trixie-staging/main armhf libpsl5 armhf 0.21.2-1+b1 [57.8 kB]
Get:62 http://172.17.4.1/private trixie-staging/main armhf librtmp1 armhf 2.4+20151223.gitfa8646d.1-2+b2 [54.2 kB]
Get:63 http://172.17.4.1/private trixie-staging/main armhf libssh2-1 armhf 1.11.0-2 [195 kB]
Get:64 http://172.17.4.1/private trixie-staging/main armhf libcurl4 armhf 8.4.0-2+rpi1 [362 kB]
Get:65 http://172.17.4.1/private trixie-staging/main armhf libjsoncpp25 armhf 1.9.5-6 [64.7 kB]
Get:66 http://172.17.4.1/private trixie-staging/main armhf librhash0 armhf 1.4.3-3 [142 kB]
Get:67 http://172.17.4.1/private trixie-staging/main armhf libuv1 armhf 1.46.0-2+rpi1 [128 kB]
Get:68 http://172.17.4.1/private trixie-staging/main armhf cmake-data all 3.27.8-1 [2104 kB]
Get:69 http://172.17.4.1/private trixie-staging/main armhf cmake armhf 3.27.8-1 [7635 kB]
Get:70 http://172.17.4.1/private trixie-staging/main armhf libdebhelper-perl all 13.11.8 [82.1 kB]
Get:71 http://172.17.4.1/private trixie-staging/main armhf libtool all 2.4.7-7 [517 kB]
Get:72 http://172.17.4.1/private trixie-staging/main armhf dh-autoreconf all 20 [17.1 kB]
Get:73 http://172.17.4.1/private trixie-staging/main armhf libarchive-zip-perl all 1.68-1 [104 kB]
Get:74 http://172.17.4.1/private trixie-staging/main armhf libsub-override-perl all 0.09-4 [9304 B]
Get:75 http://172.17.4.1/private trixie-staging/main armhf libfile-stripnondeterminism-perl all 1.13.1-1 [19.4 kB]
Get:76 http://172.17.4.1/private trixie-staging/main armhf dh-strip-nondeterminism all 1.13.1-1 [8620 B]
Get:77 http://172.17.4.1/private trixie-staging/main armhf libelf1 armhf 0.188-2.1+rpi1 [171 kB]
Get:78 http://172.17.4.1/private trixie-staging/main armhf dwz armhf 0.15-1 [92.4 kB]
Get:79 http://172.17.4.1/private trixie-staging/main armhf gettext armhf 0.21-13 [1201 kB]
Get:80 http://172.17.4.1/private trixie-staging/main armhf intltool-debian all 0.35.0+20060710.6 [22.9 kB]
Get:81 http://172.17.4.1/private trixie-staging/main armhf po-debconf all 1.0.21+nmu1 [248 kB]
Get:82 http://172.17.4.1/private trixie-staging/main armhf debhelper all 13.11.8 [956 kB]
Get:83 http://172.17.4.1/private trixie-staging/main armhf xml-core all 0.18+nmu1 [23.8 kB]
Get:84 http://172.17.4.1/private trixie-staging/main armhf docutils-common all 0.20.1+dfsg-2 [128 kB]
Get:85 http://172.17.4.1/private trixie-staging/main armhf libpng16-16 armhf 1.6.40-2 [258 kB]
Get:86 http://172.17.4.1/private trixie-staging/main armhf libfreetype6 armhf 2.13.2+dfsg-1 [366 kB]
Get:87 http://172.17.4.1/private trixie-staging/main armhf fonts-dejavu-mono all 2.37-8 [489 kB]
Get:88 http://172.17.4.1/private trixie-staging/main armhf fonts-dejavu-core all 2.37-8 [840 kB]
Get:89 http://172.17.4.1/private trixie-staging/main armhf fontconfig-config armhf 2.14.2-6 [316 kB]
Get:90 http://172.17.4.1/private trixie-staging/main armhf libfontconfig1 armhf 2.14.2-6 [367 kB]
Get:91 http://172.17.4.1/private trixie-staging/main armhf fontconfig armhf 2.14.2-6 [461 kB]
Get:92 http://172.17.4.1/private trixie-staging/main armhf fonts-mathjax all 2.7.9+dfsg-1 [2210 kB]
Get:93 http://172.17.4.1/private trixie-staging/main armhf gdal-data all 3.8.0+dfsg-1 [541 kB]
Get:94 http://172.17.4.1/private trixie-staging/main armhf gdal-plugins armhf 3.8.0+dfsg-1 [325 kB]
Get:95 http://172.17.4.1/private trixie-staging/main armhf libcdt5 armhf 2.42.2-7+b2 [37.3 kB]
Get:96 http://172.17.4.1/private trixie-staging/main armhf libcgraph6 armhf 2.42.2-7+b2 [56.0 kB]
Get:97 http://172.17.4.1/private trixie-staging/main armhf libaom3 armhf 3.7.0-1 [1387 kB]
Get:98 http://172.17.4.1/private trixie-staging/main armhf libdav1d7 armhf 1.3.0-2+rpi1 [214 kB]
Get:99 http://172.17.4.1/private trixie-staging/main armhf libabsl20220623 armhf 20220623.1-3 [356 kB]
Get:100 http://172.17.4.1/private trixie-staging/main armhf libgav1-1 armhf 0.18.0-1+rpi1+b1 [285 kB]
Get:101 http://172.17.4.1/private trixie-staging/main armhf librav1e0 armhf 0.6.6-3+rpi1 [548 kB]
Get:102 http://172.17.4.1/private trixie-staging/main armhf libsharpyuv0 armhf 1.3.2-0.3 [106 kB]
Get:103 http://172.17.4.1/private trixie-staging/main armhf libsvtav1enc1d1 armhf 1.7.0+dfsg-2 [884 kB]
Get:104 http://172.17.4.1/private trixie-staging/main armhf libjpeg62-turbo armhf 1:2.1.5-2 [143 kB]
Get:105 http://172.17.4.1/private trixie-staging/main armhf libyuv0 armhf 0.0~git20230907.cbfb661-1 [82.6 kB]
Get:106 http://172.17.4.1/private trixie-staging/main armhf libavif16 armhf 1.0.1-2+b1 [93.8 kB]
Get:107 http://172.17.4.1/private trixie-staging/main armhf libheif-plugin-dav1d armhf 1.17.1-1+b1 [9480 B]
Get:108 http://172.17.4.1/private trixie-staging/main armhf libde265-0 armhf 1.0.11-1+rpi1+b1 [137 kB]
Get:109 http://172.17.4.1/private trixie-staging/main armhf libheif-plugin-libde265 armhf 1.17.1-1+b1 [12.4 kB]
Get:110 http://172.17.4.1/private trixie-staging/main armhf libheif1 armhf 1.17.1-1+b1 [235 kB]
Get:111 http://172.17.4.1/private trixie-staging/main armhf libdeflate0 armhf 1.18-1 [38.3 kB]
Get:112 http://172.17.4.1/private trixie-staging/main armhf libjbig0 armhf 2.1-6.1 [27.0 kB]
Get:113 http://172.17.4.1/private trixie-staging/main armhf liblerc4 armhf 4.0.0+ds-3 [133 kB]
Get:114 http://172.17.4.1/private trixie-staging/main armhf libwebp7 armhf 1.3.2-0.3 [261 kB]
Get:115 http://172.17.4.1/private trixie-staging/main armhf libtiff6 armhf 4.5.1+git230720-1 [298 kB]
Get:116 http://172.17.4.1/private trixie-staging/main armhf libxau6 armhf 1:1.0.9-1 [19.1 kB]
Get:117 http://172.17.4.1/private trixie-staging/main armhf libxdmcp6 armhf 1:1.1.2-3 [25.0 kB]
Get:118 http://172.17.4.1/private trixie-staging/main armhf libxcb1 armhf 1.15-1 [139 kB]
Get:119 http://172.17.4.1/private trixie-staging/main armhf libx11-data all 2:1.8.7-1 [328 kB]
Get:120 http://172.17.4.1/private trixie-staging/main armhf libx11-6 armhf 2:1.8.7-1 [729 kB]
Get:121 http://172.17.4.1/private trixie-staging/main armhf libxpm4 armhf 1:3.5.17-1 [49.3 kB]
Get:122 http://172.17.4.1/private trixie-staging/main armhf libgd3 armhf 2.3.3-9+b1 [102 kB]
Get:123 http://172.17.4.1/private trixie-staging/main armhf libglib2.0-0 armhf 2.78.1-4 [1257 kB]
Get:124 http://172.17.4.1/private trixie-staging/main armhf libgts-0.7-5 armhf 0.7.6+darcs121130-5 [134 kB]
Get:125 http://172.17.4.1/private trixie-staging/main armhf libpixman-1-0 armhf 0.42.2-1 [461 kB]
Get:126 http://172.17.4.1/private trixie-staging/main armhf libxcb-render0 armhf 1.15-1 [114 kB]
Get:127 http://172.17.4.1/private trixie-staging/main armhf libxcb-shm0 armhf 1.15-1 [106 kB]
Get:128 http://172.17.4.1/private trixie-staging/main armhf libxext6 armhf 2:1.3.4-1 [48.0 kB]
Get:129 http://172.17.4.1/private trixie-staging/main armhf libxrender1 armhf 1:0.9.10-1.1 [30.0 kB]
Get:130 http://172.17.4.1/private trixie-staging/main armhf libcairo2 armhf 1.18.0-1 [425 kB]
Get:131 http://172.17.4.1/private trixie-staging/main armhf libltdl7 armhf 2.4.7-7 [390 kB]
Get:132 http://172.17.4.1/private trixie-staging/main armhf libfribidi0 armhf 1.0.13-3 [69.9 kB]
Get:133 http://172.17.4.1/private trixie-staging/main armhf libgraphite2-3 armhf 1.3.14-1 [70.3 kB]
Get:134 http://172.17.4.1/private trixie-staging/main armhf libharfbuzz0b armhf 8.0.1-1 [2098 kB]
Get:135 http://172.17.4.1/private trixie-staging/main armhf libthai-data all 0.1.29-1 [176 kB]
Get:136 http://172.17.4.1/private trixie-staging/main armhf libdatrie1 armhf 0.2.13-2+b2 [39.9 kB]
Get:137 http://172.17.4.1/private trixie-staging/main armhf libthai0 armhf 0.1.29-1 [54.5 kB]
Get:138 http://172.17.4.1/private trixie-staging/main armhf libpango-1.0-0 armhf 1.51.0+ds-3 [188 kB]
Get:139 http://172.17.4.1/private trixie-staging/main armhf libpangoft2-1.0-0 armhf 1.51.0+ds-3 [40.3 kB]
Get:140 http://172.17.4.1/private trixie-staging/main armhf libpangocairo-1.0-0 armhf 1.51.0+ds-3 [30.5 kB]
Get:141 http://172.17.4.1/private trixie-staging/main armhf libpathplan4 armhf 2.42.2-7+b2 [39.5 kB]
Get:142 http://172.17.4.1/private trixie-staging/main armhf libgvc6 armhf 2.42.2-7+b2 [566 kB]
Get:143 http://172.17.4.1/private trixie-staging/main armhf libgvpr2 armhf 2.42.2-7+b2 [162 kB]
Get:144 http://172.17.4.1/private trixie-staging/main armhf liblab-gamut1 armhf 2.42.2-7+b2 [197 kB]
Get:145 http://172.17.4.1/private trixie-staging/main armhf x11-common all 1:7.7+23 [252 kB]
Get:146 http://172.17.4.1/private trixie-staging/main armhf libice6 armhf 2:1.0.10-1 [51.7 kB]
Get:147 http://172.17.4.1/private trixie-staging/main armhf libsm6 armhf 2:1.2.3-1 [32.9 kB]
Get:148 http://172.17.4.1/private trixie-staging/main armhf libxt6 armhf 1:1.2.1-1.1 [155 kB]
Get:149 http://172.17.4.1/private trixie-staging/main armhf libxmu6 armhf 2:1.1.3-3 [52.0 kB]
Get:150 http://172.17.4.1/private trixie-staging/main armhf libxaw7 armhf 2:1.0.14-1 [165 kB]
Get:151 http://172.17.4.1/private trixie-staging/main armhf graphviz armhf 2.42.2-7+b2 [479 kB]
Get:152 http://172.17.4.1/private trixie-staging/main armhf icu-devtools armhf 72.1-4 [174 kB]
Get:153 http://172.17.4.1/private trixie-staging/main armhf libaec0 armhf 1.1.2-1 [21.3 kB]
Get:154 http://172.17.4.1/private trixie-staging/main armhf libblas3 armhf 3.11.0-2 [100.0 kB]
Get:155 http://172.17.4.1/private trixie-staging/main armhf libgfortran5 armhf 13.2.0-5+rpi1 [247 kB]
Get:156 http://172.17.4.1/private trixie-staging/main armhf liblapack3 armhf 3.11.0-2 [1624 kB]
Get:157 http://172.17.4.1/private trixie-staging/main armhf libarpack2 armhf 3.9.1-1 [80.8 kB]
Get:158 http://172.17.4.1/private trixie-staging/main armhf libsuperlu6 armhf 6.0.1+dfsg1-1 [130 kB]
Get:159 http://172.17.4.1/private trixie-staging/main armhf libarmadillo12 armhf 1:12.6.4+dfsg-1 [99.3 kB]
Get:160 http://172.17.4.1/private trixie-staging/main armhf libsnappy1v5 armhf 1.1.10-1 [24.8 kB]
Get:161 http://172.17.4.1/private trixie-staging/main armhf libblosc1 armhf 1.21.5+ds-1 [36.9 kB]
Get:162 http://172.17.4.1/private trixie-staging/main armhf libboost1.74-dev armhf 1.74.0+ds1-23 [9511 kB]
Get:163 http://172.17.4.1/private trixie-staging/main armhf libboost-regex1.74.0 armhf 1.74.0+ds1-23 [421 kB]
Get:164 http://172.17.4.1/private trixie-staging/main armhf libboost-graph1.74.0 armhf 1.74.0+ds1-23 [284 kB]
Get:165 http://172.17.4.1/private trixie-staging/main armhf libicu-dev armhf 72.1-4 [9956 kB]
Get:166 http://172.17.4.1/private trixie-staging/main armhf libboost-regex1.74-dev armhf 1.74.0+ds1-23 [526 kB]
Get:167 http://172.17.4.1/private trixie-staging/main armhf libboost-serialization1.74.0 armhf 1.74.0+ds1-23 [296 kB]
Get:168 http://172.17.4.1/private trixie-staging/main armhf libboost-serialization1.74-dev armhf 1.74.0+ds1-23 [363 kB]
Get:169 http://172.17.4.1/private trixie-staging/main armhf libboost-test1.74.0 armhf 1.74.0+ds1-23 [404 kB]
Get:170 http://172.17.4.1/private trixie-staging/main armhf libboost-test1.74-dev armhf 1.74.0+ds1-23 [492 kB]
Get:171 http://172.17.4.1/private trixie-staging/main armhf libboost-graph1.74-dev armhf 1.74.0+ds1-23 [1520 kB]
Get:172 http://172.17.4.1/private trixie-staging/main armhf libboost-graph-dev armhf 1.74.0.3+b4 [4712 B]
Get:173 http://172.17.4.1/private trixie-staging/main armhf libcurl3-gnutls armhf 8.4.0-2+rpi1 [358 kB]
Get:174 http://172.17.4.1/private trixie-staging/main armhf libcfitsio10 armhf 4.3.0-2 [504 kB]
Get:175 http://172.17.4.1/private trixie-staging/main armhf libffi-dev armhf 3.4.4-1 [60.4 kB]
Get:176 http://172.17.4.1/private trixie-staging/main armhf libminizip1 armhf 1:1.2.13.dfsg-3 [48.5 kB]
Get:177 http://172.17.4.1/private trixie-staging/main armhf libfreexl1 armhf 2.0.0-1 [35.0 kB]
Get:178 http://172.17.4.1/private trixie-staging/main armhf libfyba0 armhf 4.1.1-8 [98.1 kB]
Get:179 http://172.17.4.1/private trixie-staging/main armhf libgeos3.12.1 armhf 3.12.1-1 [775 kB]
Get:180 http://172.17.4.1/private trixie-staging/main armhf libgeos-c1v5 armhf 3.12.1-1 [83.5 kB]
Get:181 http://172.17.4.1/private trixie-staging/main armhf proj-data all 9.3.0-1 [6227 kB]
Get:182 http://172.17.4.1/private trixie-staging/main armhf libproj25 armhf 9.3.0-1 [1087 kB]
Get:183 http://172.17.4.1/private trixie-staging/main armhf libgeotiff5 armhf 1.7.1-3 [59.9 kB]
Get:184 http://172.17.4.1/private trixie-staging/main armhf libgif7 armhf 5.2.1-2.5 [44.7 kB]
Get:185 http://172.17.4.1/private trixie-staging/main armhf libhdf4-0-alt armhf 4.2.16-3 [222 kB]
Get:186 http://172.17.4.1/private trixie-staging/main armhf libsz2 armhf 1.1.2-1 [7700 B]
Get:187 http://172.17.4.1/private trixie-staging/main armhf libhdf5-103-1 armhf 1.10.10+repack-3 [1215 kB]
Get:188 http://172.17.4.1/private trixie-staging/main armhf libjson-c5 armhf 0.17-1 [39.7 kB]
Get:189 http://172.17.4.1/private trixie-staging/main armhf liburiparser1 armhf 0.9.7+dfsg-2 [35.9 kB]
Get:190 http://172.17.4.1/private trixie-staging/main armhf libkmlbase1 armhf 1.3.0-10 [39.4 kB]
Get:191 http://172.17.4.1/private trixie-staging/main armhf libkmldom1 armhf 1.3.0-10 [125 kB]
Get:192 http://172.17.4.1/private trixie-staging/main armhf libkmlengine1 armhf 1.3.0-10 [62.8 kB]
Get:193 http://172.17.4.1/private trixie-staging/main armhf mysql-common all 5.8+1.1.0 [6636 B]
Get:194 http://172.17.4.1/private trixie-staging/main armhf mariadb-common all 1:10.11.3-1+rpi1 [24.1 kB]
Get:195 http://172.17.4.1/private trixie-staging/main armhf libmariadb3 armhf 1:10.11.3-1+rpi1 [154 kB]
Get:196 http://172.17.4.1/private trixie-staging/main armhf libhdf5-hl-100 armhf 1.10.10+repack-3 [59.9 kB]
Get:197 http://172.17.4.1/private trixie-staging/main armhf libnetcdf19 armhf 1:4.9.2-2 [408 kB]
Get:198 http://172.17.4.1/private trixie-staging/main armhf libodbc2 armhf 2.3.12-1 [124 kB]
Get:199 http://172.17.4.1/private trixie-staging/main armhf unixodbc-common all 2.3.12-1 [8496 B]
Get:200 http://172.17.4.1/private trixie-staging/main armhf libodbcinst2 armhf 2.3.12-1 [28.0 kB]
Get:201 http://172.17.4.1/private trixie-staging/main armhf libogdi4.1 armhf 4.1.0+ds-6 [170 kB]
Get:202 http://172.17.4.1/private trixie-staging/main armhf libopenjp2-7 armhf 2.5.0-2 [164 kB]
Get:203 http://172.17.4.1/private trixie-staging/main armhf liblcms2-2 armhf 2.14-2 [124 kB]
Get:204 http://172.17.4.1/private trixie-staging/main armhf libnspr4 armhf 2:4.35-1.1 [85.2 kB]
Get:205 http://172.17.4.1/private trixie-staging/main armhf libnss3 armhf 2:3.93-1 [1105 kB]
Get:206 http://172.17.4.1/private trixie-staging/main armhf libpoppler126 armhf 22.12.0-2 [1682 kB]
Get:207 http://172.17.4.1/private trixie-staging/main armhf libpq5 armhf 16.1-1+rpi1 [198 kB]
Get:208 http://172.17.4.1/private trixie-staging/main armhf libqhull-r8.0 armhf 2020.2-6 [216 kB]
Get:209 http://172.17.4.1/private trixie-staging/main armhf librttopo1 armhf 1.1.0-3 [142 kB]
Get:210 http://172.17.4.1/private trixie-staging/main armhf libspatialite8 armhf 5.1.0-1 [1691 kB]
Get:211 http://172.17.4.1/private trixie-staging/main armhf libxerces-c3.2 armhf 3.2.4+debian-1 [709 kB]
Get:212 http://172.17.4.1/private trixie-staging/main armhf libgdal34 armhf 3.8.0+dfsg-1 [7134 kB]
Get:213 http://172.17.4.1/private trixie-staging/main armhf libjs-jquery all 3.6.1+dfsg+~3.5.14-1 [326 kB]
Get:214 http://172.17.4.1/private trixie-staging/main armhf libjs-mathjax all 2.7.9+dfsg-1 [5667 kB]
Get:215 http://172.17.4.1/private trixie-staging/main armhf libjs-underscore all 1.13.4~dfsg+~1.11.4-3 [116 kB]
Get:216 http://172.17.4.1/private trixie-staging/main armhf libjs-sphinxdoc all 7.2.6-2 [149 kB]
Get:217 http://172.17.4.1/private trixie-staging/main armhf libncurses6 armhf 6.4+20231016-1 [80.0 kB]
Get:218 http://172.17.4.1/private trixie-staging/main armhf libncurses-dev armhf 6.4+20231016-1 [290 kB]
Get:219 http://172.17.4.1/private trixie-staging/main armhf libpfm4 armhf 4.13.0+git15-gefd10fb-2 [45.7 kB]
Get:220 http://172.17.4.1/private trixie-staging/main armhf libssl-dev armhf 3.0.11-1 [2105 kB]
Get:221 http://172.17.4.1/private trixie-staging/main armhf libpq-dev armhf 16.1-1+rpi1 [130 kB]
Get:222 http://172.17.4.1/private trixie-staging/main armhf libxml2-dev armhf 2.9.14+dfsg-1.3 [636 kB]
Get:223 http://172.17.4.1/private trixie-staging/main armhf libyaml-0-2 armhf 0.2.5-1 [44.6 kB]
Get:224 http://172.17.4.1/private trixie-staging/main armhf libz3-dev armhf 4.8.12-3.1 [90.6 kB]
Get:225 http://172.17.4.1/private trixie-staging/main armhf llvm-16-runtime armhf 1:16.0.6-15+rpi1 [459 kB]
Get:226 http://172.17.4.1/private trixie-staging/main armhf llvm-16 armhf 1:16.0.6-15+rpi1 [19.0 MB]
Get:227 http://172.17.4.1/private trixie-staging/main armhf python3-pkg-resources all 68.1.2-2 [241 kB]
Get:228 http://172.17.4.1/private trixie-staging/main armhf python3-pygments all 2.15.1+dfsg-1 [817 kB]
Get:229 http://172.17.4.1/private trixie-staging/main armhf python3-yaml armhf 6.0.1-1 [108 kB]
Get:230 http://172.17.4.1/private trixie-staging/main armhf llvm-16-tools armhf 1:16.0.6-15+rpi1 [424 kB]
Get:231 http://172.17.4.1/private trixie-staging/main armhf llvm-16-dev armhf 1:16.0.6-15+rpi1 [38.4 MB]
Get:232 http://172.17.4.1/private trixie-staging/main armhf postgis armhf 3.4.1+dfsg-1 [139 kB]
Get:233 http://172.17.4.1/private trixie-staging/main armhf postgresql-client-16 armhf 16.1-1+rpi1 [1768 kB]
Get:234 http://172.17.4.1/private trixie-staging/main armhf postgresql-server-dev-16 armhf 16.1-1+rpi1 [1163 kB]
Get:235 http://172.17.4.1/private trixie-staging/main armhf postgresql-server-dev-all armhf 256 [21.6 kB]
Get:236 http://172.17.4.1/private trixie-staging/main armhf python-babel-localedata all 2.10.3-3 [5611 kB]
Get:237 http://172.17.4.1/private trixie-staging/main armhf python3-alabaster all 0.7.12-1 [20.8 kB]
Get:238 http://172.17.4.1/private trixie-staging/main armhf python3-tz all 2023.3.post1-1 [30.8 kB]
Get:239 http://172.17.4.1/private trixie-staging/main armhf python3-babel all 2.10.3-3 [100.0 kB]
Get:240 http://172.17.4.1/private trixie-staging/main armhf python3-certifi all 2023.7.22-1 [150 kB]
Get:241 http://172.17.4.1/private trixie-staging/main armhf python3-chardet all 5.2.0+dfsg-1 [107 kB]
Get:242 http://172.17.4.1/private trixie-staging/main armhf python3-charset-normalizer all 3.3.2-1 [51.6 kB]
Get:243 http://172.17.4.1/private trixie-staging/main armhf python3-lib2to3 all 3.11.5-1 [77.5 kB]
Get:244 http://172.17.4.1/private trixie-staging/main armhf python3-distutils all 3.11.5-1 [131 kB]
Get:245 http://172.17.4.1/private trixie-staging/main armhf python3-roman all 3.3-3 [9880 B]
Get:246 http://172.17.4.1/private trixie-staging/main armhf python3-docutils all 0.20.1+dfsg-2 [389 kB]
Get:247 http://172.17.4.1/private trixie-staging/main armhf python3-idna all 3.3-2 [39.1 kB]
Get:248 http://172.17.4.1/private trixie-staging/main armhf python3-imagesize all 1.4.1-1 [6688 B]
Get:249 http://172.17.4.1/private trixie-staging/main armhf python3-markupsafe armhf 2.1.3-1 [12.8 kB]
Get:250 http://172.17.4.1/private trixie-staging/main armhf python3-jinja2 all 3.1.2-1 [119 kB]
Get:251 http://172.17.4.1/private trixie-staging/main armhf python3-packaging all 23.2-1 [44.8 kB]
Get:252 http://172.17.4.1/private trixie-staging/main armhf python3-six all 1.16.0-4 [17.5 kB]
Get:253 http://172.17.4.1/private trixie-staging/main armhf python3-urllib3 all 1.26.18-1 [116 kB]
Get:254 http://172.17.4.1/private trixie-staging/main armhf python3-requests all 2.31.0+dfsg-1 [68.6 kB]
Get:255 http://172.17.4.1/private trixie-staging/main armhf python3-snowballstemmer all 2.2.0-4 [58.0 kB]
Get:256 http://172.17.4.1/private trixie-staging/main armhf sphinx-common all 7.2.6-2 [703 kB]
Get:257 http://172.17.4.1/private trixie-staging/main armhf python3-sphinx all 7.2.6-2 [552 kB]
Get:258 http://172.17.4.1/private trixie-staging/main armhf rdfind armhf 1.6.0-1 [34.8 kB]
debconf: delaying package configuration, since apt-utils is not installed
Fetched 237 MB in 27s (8924 kB/s)
(Reading database ... 12577 files and directories currently installed.)
Preparing to unpack .../mount_2.39.2-6_armhf.deb ...
Unpacking mount (2.39.2-6) over (2.39.2-5) ...
Preparing to unpack .../bsdutils_1%3a2.39.2-6_armhf.deb ...
Unpacking bsdutils (1:2.39.2-6) over (1:2.39.2-5) ...
Setting up bsdutils (1:2.39.2-6) ...
(Reading database ... 12577 files and directories currently installed.)
Preparing to unpack .../util-linux_2.39.2-6_armhf.deb ...
Unpacking util-linux (2.39.2-6) over (2.39.2-5) ...
Setting up util-linux (2.39.2-6) ...
Selecting previously unselected package libjson-perl.
(Reading database ... 12577 files and directories currently installed.)
Preparing to unpack .../00-libjson-perl_4.10000-1_all.deb ...
Unpacking libjson-perl (4.10000-1) ...
Selecting previously unselected package netbase.
Preparing to unpack .../01-netbase_6.4_all.deb ...
Unpacking netbase (6.4) ...
Selecting previously unselected package postgresql-client-common.
Preparing to unpack .../02-postgresql-client-common_256_all.deb ...
Unpacking postgresql-client-common (256) ...
Selecting previously unselected package openssl.
Preparing to unpack .../03-openssl_3.0.11-1_armhf.deb ...
Unpacking openssl (3.0.11-1) ...
Selecting previously unselected package ssl-cert.
Preparing to unpack .../04-ssl-cert_1.1.2_all.deb ...
Unpacking ssl-cert (1.1.2) ...
Selecting previously unselected package sensible-utils.
Preparing to unpack .../05-sensible-utils_0.0.20_all.deb ...
Unpacking sensible-utils (0.0.20) ...
Selecting previously unselected package ucf.
Preparing to unpack .../06-ucf_3.0043+nmu1_all.deb ...
Moving old data out of the way
Unpacking ucf (3.0043+nmu1) ...
Selecting previously unselected package postgresql-common.
Preparing to unpack .../07-postgresql-common_256_all.deb ...
Adding 'diversion of /usr/bin/pg_config to /usr/bin/pg_config.libpq-dev by postgresql-common'
Unpacking postgresql-common (256) ...
Selecting previously unselected package libpython3.11-minimal:armhf.
Preparing to unpack .../08-libpython3.11-minimal_3.11.6-3_armhf.deb ...
Unpacking libpython3.11-minimal:armhf (3.11.6-3) ...
Selecting previously unselected package libexpat1:armhf.
Preparing to unpack .../09-libexpat1_2.5.0-2_armhf.deb ...
Unpacking libexpat1:armhf (2.5.0-2) ...
Selecting previously unselected package python3.11-minimal.
Preparing to unpack .../10-python3.11-minimal_3.11.6-3_armhf.deb ...
Unpacking python3.11-minimal (3.11.6-3) ...
Setting up libpython3.11-minimal:armhf (3.11.6-3) ...
Setting up libexpat1:armhf (2.5.0-2) ...
Setting up python3.11-minimal (3.11.6-3) ...
Selecting previously unselected package python3-minimal.
(Reading database ... 13485 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) ...
Preparing to unpack .../libuuid1_2.39.2-6_armhf.deb ...
Unpacking libuuid1:armhf (2.39.2-6) over (2.39.2-5) ...
Setting up libuuid1:armhf (2.39.2-6) ...
Selecting previously unselected package libpython3.11-stdlib:armhf.
(Reading database ... 13512 files and directories currently installed.)
Preparing to unpack .../libpython3.11-stdlib_3.11.6-3_armhf.deb ...
Unpacking libpython3.11-stdlib:armhf (3.11.6-3) ...
Selecting previously unselected package python3.11.
Preparing to unpack .../python3.11_3.11.6-3_armhf.deb ...
Unpacking python3.11 (3.11.6-3) ...
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 ... 13901 files and directories currently installed.)
Preparing to unpack .../python3_3.11.4-5_armhf.deb ...
Unpacking python3 (3.11.4-5) ...
Selecting previously unselected package sgml-base.
Preparing to unpack .../sgml-base_1.31_all.deb ...
Unpacking sgml-base (1.31) ...
Preparing to unpack .../libblkid1_2.39.2-6_armhf.deb ...
Unpacking libblkid1:armhf (2.39.2-6) over (2.39.2-5) ...
Setting up libblkid1:armhf (2.39.2-6) ...
(Reading database ... 13950 files and directories currently installed.)
Preparing to unpack .../libmount1_2.39.2-6_armhf.deb ...
Unpacking libmount1:armhf (2.39.2-6) over (2.39.2-5) ...
Setting up libmount1:armhf (2.39.2-6) ...
(Reading database ... 13950 files and directories currently installed.)
Preparing to unpack .../libsmartcols1_2.39.2-6_armhf.deb ...
Unpacking libsmartcols1:armhf (2.39.2-6) over (2.39.2-5) ...
Setting up libsmartcols1:armhf (2.39.2-6) ...
Selecting previously unselected package libuchardet0:armhf.
(Reading database ... 13950 files and directories currently installed.)
Preparing to unpack .../000-libuchardet0_0.0.7-1_armhf.deb ...
Unpacking libuchardet0:armhf (0.0.7-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.2-6_armhf.deb ...
Unpacking bsdextrautils (2.39.2-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 ca-certificates.
Preparing to unpack .../007-ca-certificates_20230311_all.deb ...
Unpacking ca-certificates (20230311) ...
Selecting previously unselected package libmagic-mgc.
Preparing to unpack .../008-libmagic-mgc_1%3a5.45-2_armhf.deb ...
Unpacking libmagic-mgc (1:5.45-2) ...
Selecting previously unselected package libmagic1:armhf.
Preparing to unpack .../009-libmagic1_1%3a5.45-2_armhf.deb ...
Unpacking libmagic1:armhf (1:5.45-2) ...
Selecting previously unselected package file.
Preparing to unpack .../010-file_1%3a5.45-2_armhf.deb ...
Unpacking file (1:5.45-2) ...
Selecting previously unselected package gettext-base.
Preparing to unpack .../011-gettext-base_0.21-13_armhf.deb ...
Unpacking gettext-base (0.21-13) ...
Selecting previously unselected package m4.
Preparing to unpack .../012-m4_1.4.19-4_armhf.deb ...
Unpacking m4 (1.4.19-4) ...
Selecting previously unselected package autoconf.
Preparing to unpack .../013-autoconf_2.71-3_all.deb ...
Unpacking autoconf (2.71-3) ...
Selecting previously unselected package autotools-dev.
Preparing to unpack .../014-autotools-dev_20220109.1_all.deb ...
Unpacking autotools-dev (20220109.1) ...
Selecting previously unselected package automake.
Preparing to unpack .../015-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 .../016-autopoint_0.21-13_all.deb ...
Unpacking autopoint (0.21-13) ...
Selecting previously unselected package libbsd0:armhf.
Preparing to unpack .../017-libbsd0_0.11.7-4_armhf.deb ...
Unpacking libbsd0:armhf (0.11.7-4) ...
Selecting previously unselected package libedit2:armhf.
Preparing to unpack .../018-libedit2_3.1-20230828-1_armhf.deb ...
Unpacking libedit2:armhf (3.1-20230828-1) ...
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 libz3-4:armhf.
Preparing to unpack .../021-libz3-4_4.8.12-3.1_armhf.deb ...
Unpacking libz3-4:armhf (4.8.12-3.1) ...
Selecting previously unselected package libllvm16:armhf.
Preparing to unpack .../022-libllvm16_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking libllvm16:armhf (1:16.0.6-15+rpi1) ...
Selecting previously unselected package libclang-cpp16.
Preparing to unpack .../023-libclang-cpp16_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking libclang-cpp16 (1:16.0.6-15+rpi1) ...
Selecting previously unselected package libgc1:armhf.
Preparing to unpack .../024-libgc1_1%3a8.2.4-1_armhf.deb ...
Unpacking libgc1:armhf (1:8.2.4-1) ...
Selecting previously unselected package libobjc4:armhf.
Preparing to unpack .../025-libobjc4_13.2.0-5+rpi1_armhf.deb ...
Unpacking libobjc4:armhf (13.2.0-5+rpi1) ...
Selecting previously unselected package libobjc-12-dev:armhf.
Preparing to unpack .../026-libobjc-12-dev_12.3.0-10+rpi1_armhf.deb ...
Unpacking libobjc-12-dev:armhf (12.3.0-10+rpi1) ...
Selecting previously unselected package libclang-common-16-dev.
Preparing to unpack .../027-libclang-common-16-dev_1%3a16.0.6-15+rpi1_all.deb ...
Unpacking libclang-common-16-dev (1:16.0.6-15+rpi1) ...
Selecting previously unselected package llvm-16-linker-tools.
Preparing to unpack .../028-llvm-16-linker-tools_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking llvm-16-linker-tools (1:16.0.6-15+rpi1) ...
Selecting previously unselected package libclang1-16.
Preparing to unpack .../029-libclang1-16_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking libclang1-16 (1:16.0.6-15+rpi1) ...
Selecting previously unselected package clang-16.
Preparing to unpack .../030-clang-16_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking clang-16 (1:16.0.6-15+rpi1) ...
Selecting previously unselected package libarchive13:armhf.
Preparing to unpack .../031-libarchive13_3.7.2-1_armhf.deb ...
Unpacking libarchive13:armhf (3.7.2-1) ...
Selecting previously unselected package libbrotli1:armhf.
Preparing to unpack .../032-libbrotli1_1.1.0-2_armhf.deb ...
Unpacking libbrotli1:armhf (1.1.0-2) ...
Selecting previously unselected package libnghttp2-14:armhf.
Preparing to unpack .../033-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 .../034-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 .../035-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 .../036-libssh2-1_1.11.0-2_armhf.deb ...
Unpacking libssh2-1:armhf (1.11.0-2) ...
Selecting previously unselected package libcurl4:armhf.
Preparing to unpack .../037-libcurl4_8.4.0-2+rpi1_armhf.deb ...
Unpacking libcurl4:armhf (8.4.0-2+rpi1) ...
Selecting previously unselected package libjsoncpp25:armhf.
Preparing to unpack .../038-libjsoncpp25_1.9.5-6_armhf.deb ...
Unpacking libjsoncpp25:armhf (1.9.5-6) ...
Selecting previously unselected package librhash0:armhf.
Preparing to unpack .../039-librhash0_1.4.3-3_armhf.deb ...
Unpacking librhash0:armhf (1.4.3-3) ...
Selecting previously unselected package libuv1:armhf.
Preparing to unpack .../040-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 .../041-cmake-data_3.27.8-1_all.deb ...
Unpacking cmake-data (3.27.8-1) ...
Selecting previously unselected package cmake.
Preparing to unpack .../042-cmake_3.27.8-1_armhf.deb ...
Unpacking cmake (3.27.8-1) ...
Preparing to unpack .../043-dpkg-dev_1.22.1+rpi1_all.deb ...
Unpacking dpkg-dev (1.22.1+rpi1) over (1.22.0+rpi1) ...
Preparing to unpack .../044-libdpkg-perl_1.22.1+rpi1_all.deb ...
Unpacking libdpkg-perl (1.22.1+rpi1) over (1.22.0+rpi1) ...
Selecting previously unselected package libdebhelper-perl.
Preparing to unpack .../045-libdebhelper-perl_13.11.8_all.deb ...
Unpacking libdebhelper-perl (13.11.8) ...
Selecting previously unselected package libtool.
Preparing to unpack .../046-libtool_2.4.7-7_all.deb ...
Unpacking libtool (2.4.7-7) ...
Selecting previously unselected package dh-autoreconf.
Preparing to unpack .../047-dh-autoreconf_20_all.deb ...
Unpacking dh-autoreconf (20) ...
Selecting previously unselected package libarchive-zip-perl.
Preparing to unpack .../048-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 .../049-libsub-override-perl_0.09-4_all.deb ...
Unpacking libsub-override-perl (0.09-4) ...
Selecting previously unselected package libfile-stripnondeterminism-perl.
Preparing to unpack .../050-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 .../051-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 .../052-libelf1_0.188-2.1+rpi1_armhf.deb ...
Unpacking libelf1:armhf (0.188-2.1+rpi1) ...
Selecting previously unselected package dwz.
Preparing to unpack .../053-dwz_0.15-1_armhf.deb ...
Unpacking dwz (0.15-1) ...
Selecting previously unselected package gettext.
Preparing to unpack .../054-gettext_0.21-13_armhf.deb ...
Unpacking gettext (0.21-13) ...
Selecting previously unselected package intltool-debian.
Preparing to unpack .../055-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 .../056-po-debconf_1.0.21+nmu1_all.deb ...
Unpacking po-debconf (1.0.21+nmu1) ...
Selecting previously unselected package debhelper.
Preparing to unpack .../057-debhelper_13.11.8_all.deb ...
Unpacking debhelper (13.11.8) ...
Selecting previously unselected package xml-core.
Preparing to unpack .../058-xml-core_0.18+nmu1_all.deb ...
Unpacking xml-core (0.18+nmu1) ...
Selecting previously unselected package docutils-common.
Preparing to unpack .../059-docutils-common_0.20.1+dfsg-2_all.deb ...
Unpacking docutils-common (0.20.1+dfsg-2) ...
Selecting previously unselected package libpng16-16:armhf.
Preparing to unpack .../060-libpng16-16_1.6.40-2_armhf.deb ...
Unpacking libpng16-16:armhf (1.6.40-2) ...
Selecting previously unselected package libfreetype6:armhf.
Preparing to unpack .../061-libfreetype6_2.13.2+dfsg-1_armhf.deb ...
Unpacking libfreetype6:armhf (2.13.2+dfsg-1) ...
Selecting previously unselected package fonts-dejavu-mono.
Preparing to unpack .../062-fonts-dejavu-mono_2.37-8_all.deb ...
Unpacking fonts-dejavu-mono (2.37-8) ...
Selecting previously unselected package fonts-dejavu-core.
Preparing to unpack .../063-fonts-dejavu-core_2.37-8_all.deb ...
Unpacking fonts-dejavu-core (2.37-8) ...
Selecting previously unselected package fontconfig-config.
Preparing to unpack .../064-fontconfig-config_2.14.2-6_armhf.deb ...
Unpacking fontconfig-config (2.14.2-6) ...
Selecting previously unselected package libfontconfig1:armhf.
Preparing to unpack .../065-libfontconfig1_2.14.2-6_armhf.deb ...
Unpacking libfontconfig1:armhf (2.14.2-6) ...
Selecting previously unselected package fontconfig.
Preparing to unpack .../066-fontconfig_2.14.2-6_armhf.deb ...
Unpacking fontconfig (2.14.2-6) ...
Selecting previously unselected package fonts-mathjax.
Preparing to unpack .../067-fonts-mathjax_2.7.9+dfsg-1_all.deb ...
Unpacking fonts-mathjax (2.7.9+dfsg-1) ...
Selecting previously unselected package gdal-data.
Preparing to unpack .../068-gdal-data_3.8.0+dfsg-1_all.deb ...
Unpacking gdal-data (3.8.0+dfsg-1) ...
Selecting previously unselected package gdal-plugins.
Preparing to unpack .../069-gdal-plugins_3.8.0+dfsg-1_armhf.deb ...
Unpacking gdal-plugins (3.8.0+dfsg-1) ...
Selecting previously unselected package libcdt5:armhf.
Preparing to unpack .../070-libcdt5_2.42.2-7+b2_armhf.deb ...
Unpacking libcdt5:armhf (2.42.2-7+b2) ...
Selecting previously unselected package libcgraph6:armhf.
Preparing to unpack .../071-libcgraph6_2.42.2-7+b2_armhf.deb ...
Unpacking libcgraph6:armhf (2.42.2-7+b2) ...
Selecting previously unselected package libaom3:armhf.
Preparing to unpack .../072-libaom3_3.7.0-1_armhf.deb ...
Unpacking libaom3:armhf (3.7.0-1) ...
Selecting previously unselected package libdav1d7:armhf.
Preparing to unpack .../073-libdav1d7_1.3.0-2+rpi1_armhf.deb ...
Unpacking libdav1d7:armhf (1.3.0-2+rpi1) ...
Selecting previously unselected package libabsl20220623:armhf.
Preparing to unpack .../074-libabsl20220623_20220623.1-3_armhf.deb ...
Unpacking libabsl20220623:armhf (20220623.1-3) ...
Selecting previously unselected package libgav1-1:armhf.
Preparing to unpack .../075-libgav1-1_0.18.0-1+rpi1+b1_armhf.deb ...
Unpacking libgav1-1:armhf (0.18.0-1+rpi1+b1) ...
Selecting previously unselected package librav1e0:armhf.
Preparing to unpack .../076-librav1e0_0.6.6-3+rpi1_armhf.deb ...
Unpacking librav1e0:armhf (0.6.6-3+rpi1) ...
Selecting previously unselected package libsharpyuv0:armhf.
Preparing to unpack .../077-libsharpyuv0_1.3.2-0.3_armhf.deb ...
Unpacking libsharpyuv0:armhf (1.3.2-0.3) ...
Selecting previously unselected package libsvtav1enc1d1:armhf.
Preparing to unpack .../078-libsvtav1enc1d1_1.7.0+dfsg-2_armhf.deb ...
Unpacking libsvtav1enc1d1:armhf (1.7.0+dfsg-2) ...
Selecting previously unselected package libjpeg62-turbo:armhf.
Preparing to unpack .../079-libjpeg62-turbo_1%3a2.1.5-2_armhf.deb ...
Unpacking libjpeg62-turbo:armhf (1:2.1.5-2) ...
Selecting previously unselected package libyuv0:armhf.
Preparing to unpack .../080-libyuv0_0.0~git20230907.cbfb661-1_armhf.deb ...
Unpacking libyuv0:armhf (0.0~git20230907.cbfb661-1) ...
Selecting previously unselected package libavif16:armhf.
Preparing to unpack .../081-libavif16_1.0.1-2+b1_armhf.deb ...
Unpacking libavif16:armhf (1.0.1-2+b1) ...
Selecting previously unselected package libheif-plugin-dav1d:armhf.
Preparing to unpack .../082-libheif-plugin-dav1d_1.17.1-1+b1_armhf.deb ...
Unpacking libheif-plugin-dav1d:armhf (1.17.1-1+b1) ...
Selecting previously unselected package libde265-0:armhf.
Preparing to unpack .../083-libde265-0_1.0.11-1+rpi1+b1_armhf.deb ...
Unpacking libde265-0:armhf (1.0.11-1+rpi1+b1) ...
Selecting previously unselected package libheif-plugin-libde265:armhf.
Preparing to unpack .../084-libheif-plugin-libde265_1.17.1-1+b1_armhf.deb ...
Unpacking libheif-plugin-libde265:armhf (1.17.1-1+b1) ...
Selecting previously unselected package libheif1:armhf.
Preparing to unpack .../085-libheif1_1.17.1-1+b1_armhf.deb ...
Unpacking libheif1:armhf (1.17.1-1+b1) ...
Selecting previously unselected package libdeflate0:armhf.
Preparing to unpack .../086-libdeflate0_1.18-1_armhf.deb ...
Unpacking libdeflate0:armhf (1.18-1) ...
Selecting previously unselected package libjbig0:armhf.
Preparing to unpack .../087-libjbig0_2.1-6.1_armhf.deb ...
Unpacking libjbig0:armhf (2.1-6.1) ...
Selecting previously unselected package liblerc4:armhf.
Preparing to unpack .../088-liblerc4_4.0.0+ds-3_armhf.deb ...
Unpacking liblerc4:armhf (4.0.0+ds-3) ...
Selecting previously unselected package libwebp7:armhf.
Preparing to unpack .../089-libwebp7_1.3.2-0.3_armhf.deb ...
Unpacking libwebp7:armhf (1.3.2-0.3) ...
Selecting previously unselected package libtiff6:armhf.
Preparing to unpack .../090-libtiff6_4.5.1+git230720-1_armhf.deb ...
Unpacking libtiff6:armhf (4.5.1+git230720-1) ...
Selecting previously unselected package libxau6:armhf.
Preparing to unpack .../091-libxau6_1%3a1.0.9-1_armhf.deb ...
Unpacking libxau6:armhf (1:1.0.9-1) ...
Selecting previously unselected package libxdmcp6:armhf.
Preparing to unpack .../092-libxdmcp6_1%3a1.1.2-3_armhf.deb ...
Unpacking libxdmcp6:armhf (1:1.1.2-3) ...
Selecting previously unselected package libxcb1:armhf.
Preparing to unpack .../093-libxcb1_1.15-1_armhf.deb ...
Unpacking libxcb1:armhf (1.15-1) ...
Selecting previously unselected package libx11-data.
Preparing to unpack .../094-libx11-data_2%3a1.8.7-1_all.deb ...
Unpacking libx11-data (2:1.8.7-1) ...
Selecting previously unselected package libx11-6:armhf.
Preparing to unpack .../095-libx11-6_2%3a1.8.7-1_armhf.deb ...
Unpacking libx11-6:armhf (2:1.8.7-1) ...
Selecting previously unselected package libxpm4:armhf.
Preparing to unpack .../096-libxpm4_1%3a3.5.17-1_armhf.deb ...
Unpacking libxpm4:armhf (1:3.5.17-1) ...
Selecting previously unselected package libgd3:armhf.
Preparing to unpack .../097-libgd3_2.3.3-9+b1_armhf.deb ...
Unpacking libgd3:armhf (2.3.3-9+b1) ...
Selecting previously unselected package libglib2.0-0:armhf.
Preparing to unpack .../098-libglib2.0-0_2.78.1-4_armhf.deb ...
Unpacking libglib2.0-0:armhf (2.78.1-4) ...
Selecting previously unselected package libgts-0.7-5:armhf.
Preparing to unpack .../099-libgts-0.7-5_0.7.6+darcs121130-5_armhf.deb ...
Unpacking libgts-0.7-5:armhf (0.7.6+darcs121130-5) ...
Selecting previously unselected package libpixman-1-0:armhf.
Preparing to unpack .../100-libpixman-1-0_0.42.2-1_armhf.deb ...
Unpacking libpixman-1-0:armhf (0.42.2-1) ...
Selecting previously unselected package libxcb-render0:armhf.
Preparing to unpack .../101-libxcb-render0_1.15-1_armhf.deb ...
Unpacking libxcb-render0:armhf (1.15-1) ...
Selecting previously unselected package libxcb-shm0:armhf.
Preparing to unpack .../102-libxcb-shm0_1.15-1_armhf.deb ...
Unpacking libxcb-shm0:armhf (1.15-1) ...
Selecting previously unselected package libxext6:armhf.
Preparing to unpack .../103-libxext6_2%3a1.3.4-1_armhf.deb ...
Unpacking libxext6:armhf (2:1.3.4-1) ...
Selecting previously unselected package libxrender1:armhf.
Preparing to unpack .../104-libxrender1_1%3a0.9.10-1.1_armhf.deb ...
Unpacking libxrender1:armhf (1:0.9.10-1.1) ...
Selecting previously unselected package libcairo2:armhf.
Preparing to unpack .../105-libcairo2_1.18.0-1_armhf.deb ...
Unpacking libcairo2:armhf (1.18.0-1) ...
Selecting previously unselected package libltdl7:armhf.
Preparing to unpack .../106-libltdl7_2.4.7-7_armhf.deb ...
Unpacking libltdl7:armhf (2.4.7-7) ...
Selecting previously unselected package libfribidi0:armhf.
Preparing to unpack .../107-libfribidi0_1.0.13-3_armhf.deb ...
Unpacking libfribidi0:armhf (1.0.13-3) ...
Selecting previously unselected package libgraphite2-3:armhf.
Preparing to unpack .../108-libgraphite2-3_1.3.14-1_armhf.deb ...
Unpacking libgraphite2-3:armhf (1.3.14-1) ...
Selecting previously unselected package libharfbuzz0b:armhf.
Preparing to unpack .../109-libharfbuzz0b_8.0.1-1_armhf.deb ...
Unpacking libharfbuzz0b:armhf (8.0.1-1) ...
Selecting previously unselected package libthai-data.
Preparing to unpack .../110-libthai-data_0.1.29-1_all.deb ...
Unpacking libthai-data (0.1.29-1) ...
Selecting previously unselected package libdatrie1:armhf.
Preparing to unpack .../111-libdatrie1_0.2.13-2+b2_armhf.deb ...
Unpacking libdatrie1:armhf (0.2.13-2+b2) ...
Selecting previously unselected package libthai0:armhf.
Preparing to unpack .../112-libthai0_0.1.29-1_armhf.deb ...
Unpacking libthai0:armhf (0.1.29-1) ...
Selecting previously unselected package libpango-1.0-0:armhf.
Preparing to unpack .../113-libpango-1.0-0_1.51.0+ds-3_armhf.deb ...
Unpacking libpango-1.0-0:armhf (1.51.0+ds-3) ...
Selecting previously unselected package libpangoft2-1.0-0:armhf.
Preparing to unpack .../114-libpangoft2-1.0-0_1.51.0+ds-3_armhf.deb ...
Unpacking libpangoft2-1.0-0:armhf (1.51.0+ds-3) ...
Selecting previously unselected package libpangocairo-1.0-0:armhf.
Preparing to unpack .../115-libpangocairo-1.0-0_1.51.0+ds-3_armhf.deb ...
Unpacking libpangocairo-1.0-0:armhf (1.51.0+ds-3) ...
Selecting previously unselected package libpathplan4:armhf.
Preparing to unpack .../116-libpathplan4_2.42.2-7+b2_armhf.deb ...
Unpacking libpathplan4:armhf (2.42.2-7+b2) ...
Selecting previously unselected package libgvc6.
Preparing to unpack .../117-libgvc6_2.42.2-7+b2_armhf.deb ...
Unpacking libgvc6 (2.42.2-7+b2) ...
Selecting previously unselected package libgvpr2:armhf.
Preparing to unpack .../118-libgvpr2_2.42.2-7+b2_armhf.deb ...
Unpacking libgvpr2:armhf (2.42.2-7+b2) ...
Selecting previously unselected package liblab-gamut1:armhf.
Preparing to unpack .../119-liblab-gamut1_2.42.2-7+b2_armhf.deb ...
Unpacking liblab-gamut1:armhf (2.42.2-7+b2) ...
Selecting previously unselected package x11-common.
Preparing to unpack .../120-x11-common_1%3a7.7+23_all.deb ...
Unpacking x11-common (1:7.7+23) ...
Selecting previously unselected package libice6:armhf.
Preparing to unpack .../121-libice6_2%3a1.0.10-1_armhf.deb ...
Unpacking libice6:armhf (2:1.0.10-1) ...
Selecting previously unselected package libsm6:armhf.
Preparing to unpack .../122-libsm6_2%3a1.2.3-1_armhf.deb ...
Unpacking libsm6:armhf (2:1.2.3-1) ...
Selecting previously unselected package libxt6:armhf.
Preparing to unpack .../123-libxt6_1%3a1.2.1-1.1_armhf.deb ...
Unpacking libxt6:armhf (1:1.2.1-1.1) ...
Selecting previously unselected package libxmu6:armhf.
Preparing to unpack .../124-libxmu6_2%3a1.1.3-3_armhf.deb ...
Unpacking libxmu6:armhf (2:1.1.3-3) ...
Selecting previously unselected package libxaw7:armhf.
Preparing to unpack .../125-libxaw7_2%3a1.0.14-1_armhf.deb ...
Unpacking libxaw7:armhf (2:1.0.14-1) ...
Selecting previously unselected package graphviz.
Preparing to unpack .../126-graphviz_2.42.2-7+b2_armhf.deb ...
Unpacking graphviz (2.42.2-7+b2) ...
Selecting previously unselected package icu-devtools.
Preparing to unpack .../127-icu-devtools_72.1-4_armhf.deb ...
Unpacking icu-devtools (72.1-4) ...
Selecting previously unselected package libaec0:armhf.
Preparing to unpack .../128-libaec0_1.1.2-1_armhf.deb ...
Unpacking libaec0:armhf (1.1.2-1) ...
Selecting previously unselected package libblas3:armhf.
Preparing to unpack .../129-libblas3_3.11.0-2_armhf.deb ...
Unpacking libblas3:armhf (3.11.0-2) ...
Selecting previously unselected package libgfortran5:armhf.
Preparing to unpack .../130-libgfortran5_13.2.0-5+rpi1_armhf.deb ...
Unpacking libgfortran5:armhf (13.2.0-5+rpi1) ...
Selecting previously unselected package liblapack3:armhf.
Preparing to unpack .../131-liblapack3_3.11.0-2_armhf.deb ...
Unpacking liblapack3:armhf (3.11.0-2) ...
Selecting previously unselected package libarpack2:armhf.
Preparing to unpack .../132-libarpack2_3.9.1-1_armhf.deb ...
Unpacking libarpack2:armhf (3.9.1-1) ...
Selecting previously unselected package libsuperlu6:armhf.
Preparing to unpack .../133-libsuperlu6_6.0.1+dfsg1-1_armhf.deb ...
Unpacking libsuperlu6:armhf (6.0.1+dfsg1-1) ...
Selecting previously unselected package libarmadillo12.
Preparing to unpack .../134-libarmadillo12_1%3a12.6.4+dfsg-1_armhf.deb ...
Unpacking libarmadillo12 (1:12.6.4+dfsg-1) ...
Selecting previously unselected package libsnappy1v5:armhf.
Preparing to unpack .../135-libsnappy1v5_1.1.10-1_armhf.deb ...
Unpacking libsnappy1v5:armhf (1.1.10-1) ...
Selecting previously unselected package libblosc1:armhf.
Preparing to unpack .../136-libblosc1_1.21.5+ds-1_armhf.deb ...
Unpacking libblosc1:armhf (1.21.5+ds-1) ...
Selecting previously unselected package libboost1.74-dev:armhf.
Preparing to unpack .../137-libboost1.74-dev_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost1.74-dev:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-regex1.74.0:armhf.
Preparing to unpack .../138-libboost-regex1.74.0_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-regex1.74.0:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-graph1.74.0:armhf.
Preparing to unpack .../139-libboost-graph1.74.0_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-graph1.74.0:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libicu-dev:armhf.
Preparing to unpack .../140-libicu-dev_72.1-4_armhf.deb ...
Unpacking libicu-dev:armhf (72.1-4) ...
Selecting previously unselected package libboost-regex1.74-dev:armhf.
Preparing to unpack .../141-libboost-regex1.74-dev_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-regex1.74-dev:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-serialization1.74.0:armhf.
Preparing to unpack .../142-libboost-serialization1.74.0_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-serialization1.74.0:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-serialization1.74-dev:armhf.
Preparing to unpack .../143-libboost-serialization1.74-dev_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-serialization1.74-dev:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-test1.74.0:armhf.
Preparing to unpack .../144-libboost-test1.74.0_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-test1.74.0:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-test1.74-dev:armhf.
Preparing to unpack .../145-libboost-test1.74-dev_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-test1.74-dev:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-graph1.74-dev:armhf.
Preparing to unpack .../146-libboost-graph1.74-dev_1.74.0+ds1-23_armhf.deb ...
Unpacking libboost-graph1.74-dev:armhf (1.74.0+ds1-23) ...
Selecting previously unselected package libboost-graph-dev:armhf.
Preparing to unpack .../147-libboost-graph-dev_1.74.0.3+b4_armhf.deb ...
Unpacking libboost-graph-dev:armhf (1.74.0.3+b4) ...
Selecting previously unselected package libcurl3-gnutls:armhf.
Preparing to unpack .../148-libcurl3-gnutls_8.4.0-2+rpi1_armhf.deb ...
Unpacking libcurl3-gnutls:armhf (8.4.0-2+rpi1) ...
Selecting previously unselected package libcfitsio10:armhf.
Preparing to unpack .../149-libcfitsio10_4.3.0-2_armhf.deb ...
Unpacking libcfitsio10:armhf (4.3.0-2) ...
Selecting previously unselected package libffi-dev:armhf.
Preparing to unpack .../150-libffi-dev_3.4.4-1_armhf.deb ...
Unpacking libffi-dev:armhf (3.4.4-1) ...
Selecting previously unselected package libminizip1:armhf.
Preparing to unpack .../151-libminizip1_1%3a1.2.13.dfsg-3_armhf.deb ...
Unpacking libminizip1:armhf (1:1.2.13.dfsg-3) ...
Selecting previously unselected package libfreexl1:armhf.
Preparing to unpack .../152-libfreexl1_2.0.0-1_armhf.deb ...
Unpacking libfreexl1:armhf (2.0.0-1) ...
Selecting previously unselected package libfyba0:armhf.
Preparing to unpack .../153-libfyba0_4.1.1-8_armhf.deb ...
Unpacking libfyba0:armhf (4.1.1-8) ...
Selecting previously unselected package libgeos3.12.1:armhf.
Preparing to unpack .../154-libgeos3.12.1_3.12.1-1_armhf.deb ...
Unpacking libgeos3.12.1:armhf (3.12.1-1) ...
Selecting previously unselected package libgeos-c1v5:armhf.
Preparing to unpack .../155-libgeos-c1v5_3.12.1-1_armhf.deb ...
Unpacking libgeos-c1v5:armhf (3.12.1-1) ...
Selecting previously unselected package proj-data.
Preparing to unpack .../156-proj-data_9.3.0-1_all.deb ...
Unpacking proj-data (9.3.0-1) ...
Selecting previously unselected package libproj25:armhf.
Preparing to unpack .../157-libproj25_9.3.0-1_armhf.deb ...
Unpacking libproj25:armhf (9.3.0-1) ...
Selecting previously unselected package libgeotiff5:armhf.
Preparing to unpack .../158-libgeotiff5_1.7.1-3_armhf.deb ...
Unpacking libgeotiff5:armhf (1.7.1-3) ...
Selecting previously unselected package libgif7:armhf.
Preparing to unpack .../159-libgif7_5.2.1-2.5_armhf.deb ...
Unpacking libgif7:armhf (5.2.1-2.5) ...
Selecting previously unselected package libhdf4-0-alt.
Preparing to unpack .../160-libhdf4-0-alt_4.2.16-3_armhf.deb ...
Unpacking libhdf4-0-alt (4.2.16-3) ...
Selecting previously unselected package libsz2:armhf.
Preparing to unpack .../161-libsz2_1.1.2-1_armhf.deb ...
Unpacking libsz2:armhf (1.1.2-1) ...
Selecting previously unselected package libhdf5-103-1:armhf.
Preparing to unpack .../162-libhdf5-103-1_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-103-1:armhf (1.10.10+repack-3) ...
Selecting previously unselected package libjson-c5:armhf.
Preparing to unpack .../163-libjson-c5_0.17-1_armhf.deb ...
Unpacking libjson-c5:armhf (0.17-1) ...
Selecting previously unselected package liburiparser1:armhf.
Preparing to unpack .../164-liburiparser1_0.9.7+dfsg-2_armhf.deb ...
Unpacking liburiparser1:armhf (0.9.7+dfsg-2) ...
Selecting previously unselected package libkmlbase1:armhf.
Preparing to unpack .../165-libkmlbase1_1.3.0-10_armhf.deb ...
Unpacking libkmlbase1:armhf (1.3.0-10) ...
Selecting previously unselected package libkmldom1:armhf.
Preparing to unpack .../166-libkmldom1_1.3.0-10_armhf.deb ...
Unpacking libkmldom1:armhf (1.3.0-10) ...
Selecting previously unselected package libkmlengine1:armhf.
Preparing to unpack .../167-libkmlengine1_1.3.0-10_armhf.deb ...
Unpacking libkmlengine1:armhf (1.3.0-10) ...
Selecting previously unselected package mysql-common.
Preparing to unpack .../168-mysql-common_5.8+1.1.0_all.deb ...
Unpacking mysql-common (5.8+1.1.0) ...
Selecting previously unselected package mariadb-common.
Preparing to unpack .../169-mariadb-common_1%3a10.11.3-1+rpi1_all.deb ...
Unpacking mariadb-common (1:10.11.3-1+rpi1) ...
Selecting previously unselected package libmariadb3:armhf.
Preparing to unpack .../170-libmariadb3_1%3a10.11.3-1+rpi1_armhf.deb ...
Unpacking libmariadb3:armhf (1:10.11.3-1+rpi1) ...
Selecting previously unselected package libhdf5-hl-100:armhf.
Preparing to unpack .../171-libhdf5-hl-100_1.10.10+repack-3_armhf.deb ...
Unpacking libhdf5-hl-100:armhf (1.10.10+repack-3) ...
Selecting previously unselected package libnetcdf19:armhf.
Preparing to unpack .../172-libnetcdf19_1%3a4.9.2-2_armhf.deb ...
Unpacking libnetcdf19:armhf (1:4.9.2-2) ...
Selecting previously unselected package libodbc2:armhf.
Preparing to unpack .../173-libodbc2_2.3.12-1_armhf.deb ...
Unpacking libodbc2:armhf (2.3.12-1) ...
Selecting previously unselected package unixodbc-common.
Preparing to unpack .../174-unixodbc-common_2.3.12-1_all.deb ...
Unpacking unixodbc-common (2.3.12-1) ...
Selecting previously unselected package libodbcinst2:armhf.
Preparing to unpack .../175-libodbcinst2_2.3.12-1_armhf.deb ...
Unpacking libodbcinst2:armhf (2.3.12-1) ...
Selecting previously unselected package libogdi4.1.
Preparing to unpack .../176-libogdi4.1_4.1.0+ds-6_armhf.deb ...
Unpacking libogdi4.1 (4.1.0+ds-6) ...
Selecting previously unselected package libopenjp2-7:armhf.
Preparing to unpack .../177-libopenjp2-7_2.5.0-2_armhf.deb ...
Unpacking libopenjp2-7:armhf (2.5.0-2) ...
Selecting previously unselected package liblcms2-2:armhf.
Preparing to unpack .../178-liblcms2-2_2.14-2_armhf.deb ...
Unpacking liblcms2-2:armhf (2.14-2) ...
Selecting previously unselected package libnspr4:armhf.
Preparing to unpack .../179-libnspr4_2%3a4.35-1.1_armhf.deb ...
Unpacking libnspr4:armhf (2:4.35-1.1) ...
Selecting previously unselected package libnss3:armhf.
Preparing to unpack .../180-libnss3_2%3a3.93-1_armhf.deb ...
Unpacking libnss3:armhf (2:3.93-1) ...
Selecting previously unselected package libpoppler126:armhf.
Preparing to unpack .../181-libpoppler126_22.12.0-2_armhf.deb ...
Unpacking libpoppler126:armhf (22.12.0-2) ...
Selecting previously unselected package libpq5:armhf.
Preparing to unpack .../182-libpq5_16.1-1+rpi1_armhf.deb ...
Unpacking libpq5:armhf (16.1-1+rpi1) ...
Selecting previously unselected package libqhull-r8.0:armhf.
Preparing to unpack .../183-libqhull-r8.0_2020.2-6_armhf.deb ...
Unpacking libqhull-r8.0:armhf (2020.2-6) ...
Selecting previously unselected package librttopo1:armhf.
Preparing to unpack .../184-librttopo1_1.1.0-3_armhf.deb ...
Unpacking librttopo1:armhf (1.1.0-3) ...
Selecting previously unselected package libspatialite8:armhf.
Preparing to unpack .../185-libspatialite8_5.1.0-1_armhf.deb ...
Unpacking libspatialite8:armhf (5.1.0-1) ...
Selecting previously unselected package libxerces-c3.2:armhf.
Preparing to unpack .../186-libxerces-c3.2_3.2.4+debian-1_armhf.deb ...
Unpacking libxerces-c3.2:armhf (3.2.4+debian-1) ...
Selecting previously unselected package libgdal34.
Preparing to unpack .../187-libgdal34_3.8.0+dfsg-1_armhf.deb ...
Unpacking libgdal34 (3.8.0+dfsg-1) ...
Selecting previously unselected package libjs-jquery.
Preparing to unpack .../188-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-mathjax.
Preparing to unpack .../189-libjs-mathjax_2.7.9+dfsg-1_all.deb ...
Unpacking libjs-mathjax (2.7.9+dfsg-1) ...
Selecting previously unselected package libjs-underscore.
Preparing to unpack .../190-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 .../191-libjs-sphinxdoc_7.2.6-2_all.deb ...
Unpacking libjs-sphinxdoc (7.2.6-2) ...
Selecting previously unselected package libncurses6:armhf.
Preparing to unpack .../192-libncurses6_6.4+20231016-1_armhf.deb ...
Unpacking libncurses6:armhf (6.4+20231016-1) ...
Selecting previously unselected package libncurses-dev:armhf.
Preparing to unpack .../193-libncurses-dev_6.4+20231016-1_armhf.deb ...
Unpacking libncurses-dev:armhf (6.4+20231016-1) ...
Selecting previously unselected package libpfm4:armhf.
Preparing to unpack .../194-libpfm4_4.13.0+git15-gefd10fb-2_armhf.deb ...
Unpacking libpfm4:armhf (4.13.0+git15-gefd10fb-2) ...
Selecting previously unselected package libssl-dev:armhf.
Preparing to unpack .../195-libssl-dev_3.0.11-1_armhf.deb ...
Unpacking libssl-dev:armhf (3.0.11-1) ...
Selecting previously unselected package libpq-dev.
Preparing to unpack .../196-libpq-dev_16.1-1+rpi1_armhf.deb ...
Unpacking libpq-dev (16.1-1+rpi1) ...
Selecting previously unselected package libxml2-dev:armhf.
Preparing to unpack .../197-libxml2-dev_2.9.14+dfsg-1.3_armhf.deb ...
Unpacking libxml2-dev:armhf (2.9.14+dfsg-1.3) ...
Selecting previously unselected package libyaml-0-2:armhf.
Preparing to unpack .../198-libyaml-0-2_0.2.5-1_armhf.deb ...
Unpacking libyaml-0-2:armhf (0.2.5-1) ...
Selecting previously unselected package libz3-dev:armhf.
Preparing to unpack .../199-libz3-dev_4.8.12-3.1_armhf.deb ...
Unpacking libz3-dev:armhf (4.8.12-3.1) ...
Selecting previously unselected package llvm-16-runtime.
Preparing to unpack .../200-llvm-16-runtime_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking llvm-16-runtime (1:16.0.6-15+rpi1) ...
Selecting previously unselected package llvm-16.
Preparing to unpack .../201-llvm-16_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking llvm-16 (1:16.0.6-15+rpi1) ...
Selecting previously unselected package python3-pkg-resources.
Preparing to unpack .../202-python3-pkg-resources_68.1.2-2_all.deb ...
Unpacking python3-pkg-resources (68.1.2-2) ...
Selecting previously unselected package python3-pygments.
Preparing to unpack .../203-python3-pygments_2.15.1+dfsg-1_all.deb ...
Unpacking python3-pygments (2.15.1+dfsg-1) ...
Selecting previously unselected package python3-yaml.
Preparing to unpack .../204-python3-yaml_6.0.1-1_armhf.deb ...
Unpacking python3-yaml (6.0.1-1) ...
Selecting previously unselected package llvm-16-tools.
Preparing to unpack .../205-llvm-16-tools_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking llvm-16-tools (1:16.0.6-15+rpi1) ...
Selecting previously unselected package llvm-16-dev.
Preparing to unpack .../206-llvm-16-dev_1%3a16.0.6-15+rpi1_armhf.deb ...
Unpacking llvm-16-dev (1:16.0.6-15+rpi1) ...
Selecting previously unselected package postgis.
Preparing to unpack .../207-postgis_3.4.1+dfsg-1_armhf.deb ...
Unpacking postgis (3.4.1+dfsg-1) ...
Selecting previously unselected package postgresql-client-16.
Preparing to unpack .../208-postgresql-client-16_16.1-1+rpi1_armhf.deb ...
Unpacking postgresql-client-16 (16.1-1+rpi1) ...
Selecting previously unselected package postgresql-server-dev-16.
Preparing to unpack .../209-postgresql-server-dev-16_16.1-1+rpi1_armhf.deb ...
Unpacking postgresql-server-dev-16 (16.1-1+rpi1) ...
Selecting previously unselected package postgresql-server-dev-all:armhf.
Preparing to unpack .../210-postgresql-server-dev-all_256_armhf.deb ...
Unpacking postgresql-server-dev-all:armhf (256) ...
Selecting previously unselected package python-babel-localedata.
Preparing to unpack .../211-python-babel-localedata_2.10.3-3_all.deb ...
Unpacking python-babel-localedata (2.10.3-3) ...
Selecting previously unselected package python3-alabaster.
Preparing to unpack .../212-python3-alabaster_0.7.12-1_all.deb ...
Unpacking python3-alabaster (0.7.12-1) ...
Selecting previously unselected package python3-tz.
Preparing to unpack .../213-python3-tz_2023.3.post1-1_all.deb ...
Unpacking python3-tz (2023.3.post1-1) ...
Selecting previously unselected package python3-babel.
Preparing to unpack .../214-python3-babel_2.10.3-3_all.deb ...
Unpacking python3-babel (2.10.3-3) ...
Selecting previously unselected package python3-certifi.
Preparing to unpack .../215-python3-certifi_2023.7.22-1_all.deb ...
Unpacking python3-certifi (2023.7.22-1) ...
Selecting previously unselected package python3-chardet.
Preparing to unpack .../216-python3-chardet_5.2.0+dfsg-1_all.deb ...
Unpacking python3-chardet (5.2.0+dfsg-1) ...
Selecting previously unselected package python3-charset-normalizer.
Preparing to unpack .../217-python3-charset-normalizer_3.3.2-1_all.deb ...
Unpacking python3-charset-normalizer (3.3.2-1) ...
Selecting previously unselected package python3-lib2to3.
Preparing to unpack .../218-python3-lib2to3_3.11.5-1_all.deb ...
Unpacking python3-lib2to3 (3.11.5-1) ...
Selecting previously unselected package python3-distutils.
Preparing to unpack .../219-python3-distutils_3.11.5-1_all.deb ...
Unpacking python3-distutils (3.11.5-1) ...
Selecting previously unselected package python3-roman.
Preparing to unpack .../220-python3-roman_3.3-3_all.deb ...
Unpacking python3-roman (3.3-3) ...
Selecting previously unselected package python3-docutils.
Preparing to unpack .../221-python3-docutils_0.20.1+dfsg-2_all.deb ...
Unpacking python3-docutils (0.20.1+dfsg-2) ...
Selecting previously unselected package python3-idna.
Preparing to unpack .../222-python3-idna_3.3-2_all.deb ...
Unpacking python3-idna (3.3-2) ...
Selecting previously unselected package python3-imagesize.
Preparing to unpack .../223-python3-imagesize_1.4.1-1_all.deb ...
Unpacking python3-imagesize (1.4.1-1) ...
Selecting previously unselected package python3-markupsafe.
Preparing to unpack .../224-python3-markupsafe_2.1.3-1_armhf.deb ...
Unpacking python3-markupsafe (2.1.3-1) ...
Selecting previously unselected package python3-jinja2.
Preparing to unpack .../225-python3-jinja2_3.1.2-1_all.deb ...
Unpacking python3-jinja2 (3.1.2-1) ...
Selecting previously unselected package python3-packaging.
Preparing to unpack .../226-python3-packaging_23.2-1_all.deb ...
Unpacking python3-packaging (23.2-1) ...
Selecting previously unselected package python3-six.
Preparing to unpack .../227-python3-six_1.16.0-4_all.deb ...
Unpacking python3-six (1.16.0-4) ...
Selecting previously unselected package python3-urllib3.
Preparing to unpack .../228-python3-urllib3_1.26.18-1_all.deb ...
Unpacking python3-urllib3 (1.26.18-1) ...
Selecting previously unselected package python3-requests.
Preparing to unpack .../229-python3-requests_2.31.0+dfsg-1_all.deb ...
Unpacking python3-requests (2.31.0+dfsg-1) ...
Selecting previously unselected package python3-snowballstemmer.
Preparing to unpack .../230-python3-snowballstemmer_2.2.0-4_all.deb ...
Unpacking python3-snowballstemmer (2.2.0-4) ...
Selecting previously unselected package sphinx-common.
Preparing to unpack .../231-sphinx-common_7.2.6-2_all.deb ...
Unpacking sphinx-common (7.2.6-2) ...
Selecting previously unselected package python3-sphinx.
Preparing to unpack .../232-python3-sphinx_7.2.6-2_all.deb ...
Unpacking python3-sphinx (7.2.6-2) ...
Selecting previously unselected package rdfind.
Preparing to unpack .../233-rdfind_1.6.0-1_armhf.deb ...
Unpacking rdfind (1.6.0-1) ...
Selecting previously unselected package sbuild-build-depends-main-dummy.
Preparing to unpack .../234-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 libgraphite2-3:armhf (1.3.14-1) ...
Setting up liblcms2-2:armhf (2.14-2) ...
Setting up libpixman-1-0:armhf (0.42.2-1) ...
Setting up libsharpyuv0:armhf (1.3.2-0.3) ...
Setting up libaom3:armhf (3.7.0-1) ...
Setting up mysql-common (5.8+1.1.0) ...
update-alternatives: using /etc/mysql/my.cnf.fallback to provide /etc/mysql/my.cnf (my.cnf) in auto mode
Setting up libabsl20220623:armhf (20220623.1-3) ...
Setting up libxau6:armhf (1:1.0.9-1) ...
Setting up libpsl5:armhf (0.21.2-1+b1) ...
Setting up libboost1.74-dev:armhf (1.74.0+ds1-23) ...
Setting up fonts-mathjax (2.7.9+dfsg-1) ...
Setting up libicu72:armhf (72.1-4) ...
Setting up liblerc4:armhf (4.0.0+ds-3) ...
Setting up proj-data (9.3.0-1) ...
Setting up bsdextrautils (2.39.2-6) ...
Setting up libjs-mathjax (2.7.9+dfsg-1) ...
Setting up libdatrie1:armhf (0.2.13-2+b2) ...
Setting up libmagic-mgc (1:5.45-2) ...
Setting up libogdi4.1 (4.1.0+ds-6) ...
Setting up libminizip1:armhf (1:1.2.13.dfsg-3) ...
Setting up libarchive-zip-perl (1.68-1) ...
Setting up libyaml-0-2:armhf (0.2.5-1) ...
Setting up libglib2.0-0:armhf (2.78.1-4) ...
No schema files found: doing nothing.
Setting up libpython3.11-stdlib:armhf (3.11.6-3) ...
Setting up libdebhelper-perl (13.11.8) ...
Setting up libbrotli1:armhf (1.1.0-2) ...
Setting up rdfind (1.6.0-1) ...
Setting up liblab-gamut1:armhf (2.42.2-7+b2) ...
Setting up x11-common (1:7.7+23) ...
invoke-rc.d: could not determine current runlevel
All runlevel operations denied by policy
invoke-rc.d: policy-rc.d denied execution of restart.
Setting up libnghttp2-14:armhf (1.58.0-1) ...
Setting up libmagic1:armhf (1:5.45-2) ...
Setting up libpq5:armhf (16.1-1+rpi1) ...
Setting up libdeflate0:armhf (1.18-1) ...
Setting up gettext-base (0.21-13) ...
Setting up m4 (1.4.19-4) ...
Setting up libqhull-r8.0:armhf (2020.2-6) ...
Setting up libsvtav1enc1d1:armhf (1.7.0+dfsg-2) ...
Setting up file (1:5.45-2) ...
Setting up libffi-dev:armhf (3.4.4-1) ...
Setting up libjbig0:armhf (2.1-6.1) ...
Setting up librav1e0:armhf (0.6.6-3+rpi1) ...
Setting up libaec0:armhf (1.1.2-1) ...
Setting up gdal-data (3.8.0+dfsg-1) ...
Setting up python-babel-localedata (2.10.3-3) ...
Setting up libsnappy1v5:armhf (1.1.10-1) ...
Setting up libgeos3.12.1:armhf (3.12.1-1) ...
Setting up libgts-0.7-5:armhf (0.7.6+darcs121130-5) ...
Setting up mariadb-common (1:10.11.3-1+rpi1) ...
update-alternatives: using /etc/mysql/mariadb.cnf to provide /etc/mysql/my.cnf (my.cnf) in auto mode
Setting up autotools-dev (20220109.1) ...
Setting up libz3-4:armhf (4.8.12-3.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 libuv1:armhf (1.46.0-2+rpi1) ...
Setting up libpfm4:armhf (4.13.0+git15-gefd10fb-2) ...
Setting up libboost-test1.74.0:armhf (1.74.0+ds1-23) ...
Setting up libjpeg62-turbo:armhf (1:2.1.5-2) ...
Setting up libx11-data (2:1.8.7-1) ...
Setting up libnspr4:armhf (2:4.35-1.1) ...
Setting up librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b2) ...
Setting up libpathplan4:armhf (2.42.2-7+b2) ...
Setting up libncurses6:armhf (6.4+20231016-1) ...
Setting up libfribidi0:armhf (1.0.13-3) ...
Setting up libboost-regex1.74.0:armhf (1.74.0+ds1-23) ...
Setting up libproc2-0:armhf (2:4.0.4-2) ...
Setting up fonts-dejavu-mono (2.37-8) ...
Setting up libssl-dev:armhf (3.0.11-1) ...
Setting up libpng16-16:armhf (1.6.40-2) ...
Setting up libboost-graph1.74.0:armhf (1.74.0+ds1-23) ...
Setting up autopoint (0.21-13) ...
Setting up libjsoncpp25:armhf (1.9.5-6) ...
Setting up icu-devtools (72.1-4) ...
Setting up libgeos-c1v5:armhf (3.12.1-1) ...
Setting up libmariadb3:armhf (1:10.11.3-1+rpi1) ...
Setting up fonts-dejavu-core (2.37-8) ...
Setting up unixodbc-common (2.3.12-1) ...
Setting up libgav1-1:armhf (0.18.0-1+rpi1+b1) ...
Setting up libgc1:armhf (1:8.2.4-1) ...
Setting up libltdl7:armhf (2.4.7-7) ...
Setting up libdpkg-perl (1.22.1+rpi1) ...
Setting up libgfortran5:armhf (13.2.0-5+rpi1) ...
Setting up autoconf (2.71-3) ...
Setting up libhdf4-0-alt (4.2.16-3) ...
Setting up libwebp7:armhf (1.3.2-0.3) ...
Setting up libboost-serialization1.74.0:armhf (1.74.0+ds1-23) ...
Setting up libgif7:armhf (5.2.1-2.5) ...
Setting up libodbc2:armhf (2.3.12-1) ...
Setting up liburiparser1:armhf (0.9.7+dfsg-2) ...
Setting up librttopo1:armhf (1.1.0-3) ...
Setting up libdav1d7:armhf (1.3.0-2+rpi1) ...
Setting up mount (2.39.2-6) ...
Setting up libfreexl1:armhf (2.0.0-1) ...
Setting up sensible-utils (0.0.20) ...
Setting up librhash0:armhf (1.4.3-3) ...
Setting up libtiff6:armhf (4.5.1+git230720-1) ...
Setting up libfyba0:armhf (4.1.1-8) ...
Setting up libuchardet0:armhf (0.0.7-1) ...
Setting up procps (2:4.0.4-2) ...
Setting up libjson-perl (4.10000-1) ...
Setting up libkmlbase1:armhf (1.3.0-10) ...
Setting up libblosc1:armhf (1.21.5+ds-1) ...
Setting up libopenjp2-7:armhf (2.5.0-2) ...
Setting up libsub-override-perl (0.09-4) ...
Setting up libthai-data (0.1.29-1) ...
Setting up libssh2-1:armhf (1.11.0-2) ...
Setting up netbase (6.4) ...
Setting up sgml-base (1.31) ...
Setting up cmake-data (3.27.8-1) ...
Setting up libcdt5:armhf (2.42.2-7+b2) ...
Setting up libcgraph6:armhf (2.42.2-7+b2) ...
Setting up libjs-jquery (3.6.1+dfsg+~3.5.14-1) ...
Setting up libde265-0:armhf (1.0.11-1+rpi1+b1) ...
Setting up libboost-test1.74-dev:armhf (1.74.0+ds1-23) ...
Setting up openssl (3.0.11-1) ...
Setting up libbsd0:armhf (0.11.7-4) ...
Setting up libyuv0:armhf (0.0~git20230907.cbfb661-1) ...
Setting up libelf1:armhf (0.188-2.1+rpi1) ...
Setting up libjson-c5:armhf (0.17-1) ...
Setting up libicu-dev:armhf (72.1-4) ...
Setting up libxml2:armhf (2.9.14+dfsg-1.3) ...
Setting up libsz2:armhf (1.1.2-1) ...
Setting up libpython3-stdlib:armhf (3.11.4-5) ...
Setting up libjs-underscore (1.13.4~dfsg+~1.11.4-3) ...
Setting up gdal-plugins (3.8.0+dfsg-1) ...
Setting up libkmldom1:armhf (1.3.0-10) ...
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 postgresql-client-common (256) ...
Setting up libfile-stripnondeterminism-perl (1.13.1-1) ...
Setting up libz3-dev:armhf (4.8.12-3.1) ...
Setting up python3.11 (3.11.6-3) ...
Setting up libice6:armhf (2:1.0.10-1) ...
Setting up libodbcinst2:armhf (2.3.12-1) ...
Setting up libavif16:armhf (1.0.1-2+b1) ...
Setting up libxdmcp6:armhf (1:1.1.2-3) ...
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 libncurses-dev:armhf (6.4+20231016-1) ...
Setting up libxcb1:armhf (1.15-1) ...
Setting up gettext (0.21-13) ...
Setting up libkmlengine1:armhf (1.3.0-10) ...
Setting up libtool (2.4.7-7) ...
Setting up libarchive13:armhf (3.7.2-1) ...
Setting up libxcb-render0:armhf (1.15-1) ...
Setting up fontconfig-config (2.14.2-6) ...
Setting up postgresql-client-16 (16.1-1+rpi1) ...
update-alternatives: using /usr/share/postgresql/16/man/man1/psql.1.gz to provide /usr/share/man/man1/psql.1.gz (psql.1.gz) in auto mode
Setting up libedit2:armhf (3.1-20230828-1) ...
Setting up libarpack2:armhf (3.9.1-1) ...
Setting up libpq-dev (16.1-1+rpi1) ...
Setting up libobjc4:armhf (13.2.0-5+rpi1) ...
Setting up libcurl3-gnutls:armhf (8.4.0-2+rpi1) ...
Setting up python3 (3.11.4-5) ...
Setting up libnss3:armhf (2:3.93-1) ...
Setting up libxcb-shm0:armhf (1.15-1) ...
Setting up libcfitsio10:armhf (4.3.0-2) ...
Setting up libsuperlu6:armhf (6.0.1+dfsg1-1) ...
Setting up python3-markupsafe (2.1.3-1) ...
Setting up python3-tz (2023.3.post1-1) ...
Setting up dpkg-dev (1.22.1+rpi1) ...
Setting up intltool-debian (0.35.0+20060710.6) ...
Setting up python3-six (1.16.0-4) ...
Setting up dh-autoreconf (20) ...
Setting up libthai0:armhf (0.1.29-1) ...
Setting up ca-certificates (20230311) ...
Updating certificates in /etc/ssl/certs...
140 added, 0 removed; done.
Setting up python3-roman (3.3-3) ...
Setting up python3-jinja2 (3.1.2-1) ...
Setting up libxml2-dev:armhf (2.9.14+dfsg-1.3) ...
Setting up python3-packaging (23.2-1) ...
Setting up libfreetype6:armhf (2.13.2+dfsg-1) ...
Setting up python3-certifi (2023.7.22-1) ...
Setting up ssl-cert (1.1.2) ...
Setting up python3-snowballstemmer (2.2.0-4) ...
Setting up python3-idna (3.3-2) ...
Setting up ucf (3.0043+nmu1) ...
Setting up libjs-sphinxdoc (7.2.6-2) ...
Setting up python3-urllib3 (1.26.18-1) ...
Setting up libboost-serialization1.74-dev:armhf (1.74.0+ds1-23) ...
Setting up dh-strip-nondeterminism (1.13.1-1) ...
Setting up libobjc-12-dev:armhf (12.3.0-10+rpi1) ...
Setting up libgvpr2:armhf (2.42.2-7+b2) ...
Setting up dwz (0.15-1) ...
Setting up libboost-regex1.74-dev:armhf (1.74.0+ds1-23) ...
Setting up groff-base (1.23.0-3) ...
Setting up xml-core (0.18+nmu1) ...
Setting up libcurl4:armhf (8.4.0-2+rpi1) ...
Setting up libx11-6:armhf (2:1.8.7-1) ...
Setting up libharfbuzz0b:armhf (8.0.1-1) ...
Setting up libfontconfig1:armhf (2.14.2-6) ...
Setting up libllvm16:armhf (1:16.0.6-15+rpi1) ...
Setting up python3-lib2to3 (3.11.5-1) ...
Setting up libsm6:armhf (2:1.2.3-1) ...
Setting up libarmadillo12 (1:12.6.4+dfsg-1) ...
Setting up python3-imagesize (1.4.1-1) ...
Setting up python3-pkg-resources (68.1.2-2) ...
Setting up python3-distutils (3.11.5-1) ...
Setting up fontconfig (2.14.2-6) ...
Regenerating fonts cache... done.
Setting up libxerces-c3.2:armhf (3.2.4+debian-1) ...
Setting up libxpm4:armhf (1:3.5.17-1) ...
Setting up libxrender1:armhf (1:0.9.10-1.1) ...
Setting up libproj25:armhf (9.3.0-1) ...
Setting up libclang1-16 (1:16.0.6-15+rpi1) ...
Setting up python3-babel (2.10.3-3) ...
update-alternatives: using /usr/bin/pybabel-python3 to provide /usr/bin/pybabel (pybabel) in auto mode
Setting up python3-charset-normalizer (3.3.2-1) ...
Setting up python3-alabaster (0.7.12-1) ...
Setting up po-debconf (1.0.21+nmu1) ...
Setting up libpango-1.0-0:armhf (1.51.0+ds-3) ...
Setting up libxext6:armhf (2:1.3.4-1) ...
Setting up llvm-16-runtime (1:16.0.6-15+rpi1) ...
Setting up python3-yaml (6.0.1-1) ...
Setting up libclang-common-16-dev (1:16.0.6-15+rpi1) ...
Setting up man-db (2.12.0-1) ...
Not building database; man-db/auto-update is not 'true'.
Setting up libcairo2:armhf (1.18.0-1) ...
Setting up llvm-16-linker-tools (1:16.0.6-15+rpi1) ...
Setting up libgeotiff5:armhf (1.7.1-3) ...
Setting up python3-pygments (2.15.1+dfsg-1) ...
Setting up python3-chardet (5.2.0+dfsg-1) ...
Setting up libboost-graph1.74-dev:armhf (1.74.0+ds1-23) ...
Setting up libspatialite8:armhf (5.1.0-1) ...
Setting up sphinx-common (7.2.6-2) ...
Setting up python3-requests (2.31.0+dfsg-1) ...
Setting up postgresql-common (256) ...
supported-versions: WARNING! Unknown distribution ID in /etc/os-release: raspbian
debian found in ID_LIKE, treating as Debian
Creating config file /etc/postgresql-common/createcluster.conf with new version
Building PostgreSQL dictionaries from installed myspell/hunspell packages...
Removing obsolete dictionary files:
invoke-rc.d: could not determine current runlevel
All runlevel operations denied by policy
invoke-rc.d: policy-rc.d denied execution of start.
Setting up libxt6:armhf (1:1.2.1-1.1) ...
Setting up libpoppler126:armhf (22.12.0-2) ...
Setting up libhdf5-103-1:armhf (1.10.10+repack-3) ...
Setting up libclang-cpp16 (1:16.0.6-15+rpi1) ...
Setting up cmake (3.27.8-1) ...
Setting up llvm-16 (1:16.0.6-15+rpi1) ...
Setting up libpangoft2-1.0-0:armhf (1.51.0+ds-3) ...
Setting up libpangocairo-1.0-0:armhf (1.51.0+ds-3) ...
Setting up libhdf5-hl-100:armhf (1.10.10+repack-3) ...
Setting up libboost-graph-dev:armhf (1.74.0.3+b4) ...
Setting up libxmu6:armhf (2:1.1.3-3) ...
Setting up clang-16 (1:16.0.6-15+rpi1) ...
Setting up debhelper (13.11.8) ...
Setting up libxaw7:armhf (2:1.0.14-1) ...
Setting up llvm-16-tools (1:16.0.6-15+rpi1) ...
Setting up libnetcdf19:armhf (1:4.9.2-2) ...
Setting up llvm-16-dev (1:16.0.6-15+rpi1) ...
Setting up postgresql-server-dev-16 (16.1-1+rpi1) ...
Setting up postgresql-server-dev-all:armhf (256) ...
Setting up libheif-plugin-dav1d:armhf (1.17.1-1+b1) ...
Setting up libheif1:armhf (1.17.1-1+b1) ...
Setting up libgd3:armhf (2.3.3-9+b1) ...
Setting up libgvc6 (2.42.2-7+b2) ...
Setting up libgdal34 (3.8.0+dfsg-1) ...
Setting up graphviz (2.42.2-7+b2) ...
Setting up libheif-plugin-libde265:armhf (1.17.1-1+b1) ...
Setting up postgis (3.4.1+dfsg-1) ...
Processing triggers for libc-bin (2.37-12+rpi2) ...
Processing triggers for sgml-base (1.31) ...
Setting up docutils-common (0.20.1+dfsg-2) ...
Processing triggers for sgml-base (1.31) ...
Setting up python3-docutils (0.20.1+dfsg-2) ...
Setting up python3-sphinx (7.2.6-2) ...
Setting up sbuild-build-depends-main-dummy (0.invalid.0) ...
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-10+rpi1 g++-13_13.2.0-5+rpi1 gcc-12_12.3.0-10+rpi1 gcc-13_13.2.0-5+rpi1 libc6-dev_2.37-12+rpi2 libstdc++-12-dev_12.3.0-10+rpi1 libstdc++-13-dev_13.2.0-5+rpi1 libstdc++6_13.2.0-5+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-13 autotools-dev_20220109.1 base-files_13+rpi1 base-passwd_3.6.2 bash_5.2.15-2 binutils_2.41-6+rpi1 binutils-arm-linux-gnueabihf_2.41-6+rpi1 binutils-common_2.41-6+rpi1 bsdextrautils_2.39.2-6 bsdutils_1:2.39.2-6 build-essential_12.9 bzip2_1.0.8-5+b2 ca-certificates_20230311 clang-16_1:16.0.6-15+rpi1 cmake_3.27.8-1 cmake-data_3.27.8-1 coreutils_9.1-1 cpp_4:13.2.0-1+rpi1 cpp-12_12.3.0-10+rpi1 cpp-13_13.2.0-5+rpi1 dash_0.5.12-6 debconf_1.5.82 debhelper_13.11.8 debianutils_5.14 dh-autoreconf_20 dh-strip-nondeterminism_1.13.1-1 diffutils_1:3.10-1 dirmngr_2.2.40-1.1 docutils-common_0.20.1+dfsg-2 dpkg_1.22.1+rpi1 dpkg-dev_1.22.1+rpi1 dwz_0.15-1 e2fsprogs_1.47.0-2 fakeroot_1.32.1-1 file_1:5.45-2 findutils_4.9.0-5 fontconfig_2.14.2-6 fontconfig-config_2.14.2-6 fonts-dejavu-core_2.37-8 fonts-dejavu-mono_2.37-8 fonts-mathjax_2.7.9+dfsg-1 g++_4:13.2.0-1+rpi1 g++-12_12.3.0-10+rpi1 g++-13_13.2.0-5+rpi1 gcc_4:13.2.0-1+rpi1 gcc-10-base_10.4.0-7+rpi1 gcc-12_12.3.0-10+rpi1 gcc-12-base_12.3.0-10+rpi1 gcc-13_13.2.0-5+rpi1 gcc-13-base_13.2.0-5+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 gdal-data_3.8.0+dfsg-1 gdal-plugins_3.8.0+dfsg-1 gettext_0.21-13 gettext-base_0.21-13 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 graphviz_2.42.2-7+b2 grep_3.11-3 groff-base_1.23.0-3 gzip_1.12-1 hostname_3.23+nmu1 icu-devtools_72.1-4 init-system-helpers_1.65.2 intltool-debian_0.35.0+20060710.6 libabsl20220623_20220623.1-3 libacl1_2.3.1-3 libaec0_1.1.2-1 libaom3_3.7.0-1 libapt-pkg6.0_2.7.6 libarchive-zip-perl_1.68-1 libarchive13_3.7.2-1 libarmadillo12_1:12.6.4+dfsg-1 libarpack2_3.9.1-1 libasan8_13.2.0-5+rpi1 libassuan0_2.5.6-1 libatomic1_13.2.0-5+rpi1 libattr1_1:2.5.1-4 libaudit-common_1:3.1.1-1 libaudit1_1:3.1.1-1 libavif16_1.0.1-2+b1 libbinutils_2.41-6+rpi1 libblas3_3.11.0-2 libblkid1_2.39.2-6 libblosc1_1.21.5+ds-1 libboost-graph-dev_1.74.0.3+b4 libboost-graph1.74-dev_1.74.0+ds1-23 libboost-graph1.74.0_1.74.0+ds1-23 libboost-regex1.74-dev_1.74.0+ds1-23 libboost-regex1.74.0_1.74.0+ds1-23 libboost-serialization1.74-dev_1.74.0+ds1-23 libboost-serialization1.74.0_1.74.0+ds1-23 libboost-test1.74-dev_1.74.0+ds1-23 libboost-test1.74.0_1.74.0+ds1-23 libboost1.74-dev_1.74.0+ds1-23 libbrotli1_1.1.0-2 libbsd0_0.11.7-4 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 libcairo2_1.18.0-1 libcap-ng0_0.8.3-1+b1 libcap2_1:2.66-4 libcc1-0_13.2.0-5+rpi1 libcdt5_2.42.2-7+b2 libcfitsio10_4.3.0-2 libcgraph6_2.42.2-7+b2 libclang-common-16-dev_1:16.0.6-15+rpi1 libclang-cpp16_1:16.0.6-15+rpi1 libclang1-16_1:16.0.6-15+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 libcurl3-gnutls_8.4.0-2+rpi1 libcurl4_8.4.0-2+rpi1 libdatrie1_0.2.13-2+b2 libdav1d7_1.3.0-2+rpi1 libdb5.3_5.3.28+dfsg2-2 libde265-0_1.0.11-1+rpi1+b1 libdebconfclient0_0.271 libdebhelper-perl_13.11.8 libdeflate0_1.18-1 libdpkg-perl_1.22.1+rpi1 libedit2_3.1-20230828-1 libelf1_0.188-2.1+rpi1 libexpat1_2.5.0-2 libext2fs2_1.47.0-2 libfakeroot_1.32.1-1 libffi-dev_3.4.4-1 libffi8_3.4.4-1 libfile-stripnondeterminism-perl_1.13.1-1 libfontconfig1_2.14.2-6 libfreetype6_2.13.2+dfsg-1 libfreexl1_2.0.0-1 libfribidi0_1.0.13-3 libfyba0_4.1.1-8 libgav1-1_0.18.0-1+rpi1+b1 libgc1_1:8.2.4-1 libgcc-12-dev_12.3.0-10+rpi1 libgcc-13-dev_13.2.0-5+rpi1 libgcc-s1_13.2.0-5+rpi1 libgcrypt20_1.10.2-3 libgd3_2.3.3-9+b1 libgdal34_3.8.0+dfsg-1 libgdbm-compat4_1.23-3 libgdbm6_1.23-3 libgeos-c1v5_3.12.1-1 libgeos3.12.1_3.12.1-1 libgeotiff5_1.7.1-3 libgfortran5_13.2.0-5+rpi1 libgif7_5.2.1-2.5 libglib2.0-0_2.78.1-4 libgmp10_2:6.3.0+dfsg-2 libgnutls30_3.8.1-4 libgomp1_13.2.0-5+rpi1 libgpg-error0_1.47-2 libgraphite2-3_1.3.14-1 libgssapi-krb5-2_1.20.1-4 libgts-0.7-5_0.7.6+darcs121130-5 libgvc6_2.42.2-7+b2 libgvpr2_2.42.2-7+b2 libharfbuzz0b_8.0.1-1 libhdf4-0-alt_4.2.16-3 libhdf5-103-1_1.10.10+repack-3 libhdf5-hl-100_1.10.10+repack-3 libheif-plugin-dav1d_1.17.1-1+b1 libheif-plugin-libde265_1.17.1-1+b1 libheif1_1.17.1-1+b1 libhogweed6_3.9.1-2 libice6_2:1.0.10-1 libicu-dev_72.1-4 libicu72_72.1-4 libidn2-0_2.3.4-1 libisl23_0.26-3 libjansson4_2.14-2 libjbig0_2.1-6.1 libjpeg62-turbo_1:2.1.5-2 libjs-jquery_3.6.1+dfsg+~3.5.14-1 libjs-mathjax_2.7.9+dfsg-1 libjs-sphinxdoc_7.2.6-2 libjs-underscore_1.13.4~dfsg+~1.11.4-3 libjson-c5_0.17-1 libjson-perl_4.10000-1 libjsoncpp25_1.9.5-6 libk5crypto3_1.20.1-4 libkeyutils1_1.6.3-2 libkmlbase1_1.3.0-10 libkmldom1_1.3.0-10 libkmlengine1_1.3.0-10 libkrb5-3_1.20.1-4 libkrb5support0_1.20.1-4 libksba8_1.6.4-2 liblab-gamut1_2.42.2-7+b2 liblapack3_3.11.0-2 liblcms2-2_2.14-2 libldap-2.5-0_2.5.13+dfsg-5+rpi1 liblerc4_4.0.0+ds-3 libllvm16_1:16.0.6-15+rpi1 liblocale-gettext-perl_1.07-6 libltdl7_2.4.7-7 liblz4-1_1.9.4-1+rpi1+b1 liblzma5_5.4.4-0.1 libmagic-mgc_1:5.45-2 libmagic1_1:5.45-2 libmariadb3_1:10.11.3-1+rpi1 libmd0_1.1.0-1 libminizip1_1:1.2.13.dfsg-3 libmount1_2.39.2-6 libmpc3_1.3.1-1 libmpfr6_4.2.1-1 libncurses-dev_6.4+20231016-1 libncurses6_6.4+20231016-1 libncursesw6_6.4+20231016-1 libnetcdf19_1:4.9.2-2 libnettle8_3.9.1-2 libnghttp2-14_1.58.0-1 libnpth0_1.6-3 libnsl-dev_1.3.0-2 libnsl2_1.3.0-2 libnspr4_2:4.35-1.1 libnss3_2:3.93-1 libobjc-12-dev_12.3.0-10+rpi1 libobjc4_13.2.0-5+rpi1 libodbc2_2.3.12-1 libodbcinst2_2.3.12-1 libogdi4.1_4.1.0+ds-6 libopenjp2-7_2.5.0-2 libp11-kit0_0.25.0-5 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 libpango-1.0-0_1.51.0+ds-3 libpangocairo-1.0-0_1.51.0+ds-3 libpangoft2-1.0-0_1.51.0+ds-3 libpathplan4_2.42.2-7+b2 libpcre2-8-0_10.42-4 libperl5.36_5.36.0-9 libpfm4_4.13.0+git15-gefd10fb-2 libpipeline1_1.5.7-1 libpixman-1-0_0.42.2-1 libpng16-16_1.6.40-2 libpoppler126_22.12.0-2 libpq-dev_16.1-1+rpi1 libpq5_16.1-1+rpi1 libproc2-0_2:4.0.4-2 libproj25_9.3.0-1 libpsl5_0.21.2-1+b1 libpython3-stdlib_3.11.4-5 libpython3.11-minimal_3.11.6-3 libpython3.11-stdlib_3.11.6-3 libqhull-r8.0_2020.2-6 librav1e0_0.6.6-3+rpi1 libreadline8_8.2-1.3 librhash0_1.4.3-3 librtmp1_2.4+20151223.gitfa8646d.1-2+b2 librttopo1_1.1.0-3 libsasl2-2_2.1.28+dfsg1-3 libsasl2-modules-db_2.1.28+dfsg1-3 libseccomp2_2.5.4-1+rpi1+b1 libselinux1_3.5-1 libsemanage-common_3.5-1 libsemanage2_3.5-1 libsepol2_3.5-1 libsframe1_2.41-6+rpi1 libsharpyuv0_1.3.2-0.3 libsm6_2:1.2.3-1 libsmartcols1_2.39.2-6 libsnappy1v5_1.1.10-1 libspatialite8_5.1.0-1 libsqlite3-0_3.43.2-1 libss2_1.47.0-2 libssh2-1_1.11.0-2 libssl-dev_3.0.11-1 libssl3_3.0.11-1 libstdc++-12-dev_12.3.0-10+rpi1 libstdc++-13-dev_13.2.0-5+rpi1 libstdc++6_13.2.0-5+rpi1 libsub-override-perl_0.09-4 libsuperlu6_6.0.1+dfsg1-1 libsvtav1enc1d1_1.7.0+dfsg-2 libsystemd0_254.5-1+rpi1 libsz2_1.1.2-1 libtasn1-6_4.19.0-3 libtext-charwidth-perl_0.04-11 libtext-iconv-perl_1.7-8 libthai-data_0.1.29-1 libthai0_0.1.29-1 libtiff6_4.5.1+git230720-1 libtinfo6_6.4+20231016-1 libtirpc-common_1.3.3+ds-1 libtirpc-dev_1.3.3+ds-1 libtirpc3_1.3.3+ds-1 libtool_2.4.7-7 libubsan1_13.2.0-5+rpi1 libuchardet0_0.0.7-1 libudev1_254.5-1+rpi1 libunistring5_1.1-2 liburiparser1_0.9.7+dfsg-2 libuuid1_2.39.2-6 libuv1_1.46.0-2+rpi1 libwebp7_1.3.2-0.3 libx11-6_2:1.8.7-1 libx11-data_2:1.8.7-1 libxau6_1:1.0.9-1 libxaw7_2:1.0.14-1 libxcb-render0_1.15-1 libxcb-shm0_1.15-1 libxcb1_1.15-1 libxdmcp6_1:1.1.2-3 libxerces-c3.2_3.2.4+debian-1 libxext6_2:1.3.4-1 libxml2_2.9.14+dfsg-1.3 libxml2-dev_2.9.14+dfsg-1.3 libxmu6_2:1.1.3-3 libxpm4_1:3.5.17-1 libxrender1_1:0.9.10-1.1 libxt6_1:1.2.1-1.1 libxxhash0_0.8.2-2 libyaml-0-2_0.2.5-1 libyuv0_0.0~git20230907.cbfb661-1 libz3-4_4.8.12-3.1 libz3-dev_4.8.12-3.1 libzstd1_1.5.5+dfsg2-2 linux-libc-dev_6.5.6-1+rpi1 llvm-16_1:16.0.6-15+rpi1 llvm-16-dev_1:16.0.6-15+rpi1 llvm-16-linker-tools_1:16.0.6-15+rpi1 llvm-16-runtime_1:16.0.6-15+rpi1 llvm-16-tools_1:16.0.6-15+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 mariadb-common_1:10.11.3-1+rpi1 mawk_1.3.4.20230808-1 media-types_10.1.0 mount_2.39.2-6 mysql-common_5.8+1.1.0 ncurses-base_6.4+20231016-1 ncurses-bin_6.4+20231016-1 netbase_6.4 openssl_3.0.11-1 passwd_1:4.13+dfsg1-3 patch_2.7.6-7 perl_5.36.0-9 perl-base_5.36.0-9 perl-modules-5.36_5.36.0-9 pinentry-curses_1.2.1-1 po-debconf_1.0.21+nmu1 postgis_3.4.1+dfsg-1 postgresql-client-16_16.1-1+rpi1 postgresql-client-common_256 postgresql-common_256 postgresql-server-dev-16_16.1-1+rpi1 postgresql-server-dev-all_256 procps_2:4.0.4-2 proj-data_9.3.0-1 python-babel-localedata_2.10.3-3 python3_3.11.4-5 python3-alabaster_0.7.12-1 python3-babel_2.10.3-3 python3-certifi_2023.7.22-1 python3-chardet_5.2.0+dfsg-1 python3-charset-normalizer_3.3.2-1 python3-distutils_3.11.5-1 python3-docutils_0.20.1+dfsg-2 python3-idna_3.3-2 python3-imagesize_1.4.1-1 python3-jinja2_3.1.2-1 python3-lib2to3_3.11.5-1 python3-markupsafe_2.1.3-1 python3-minimal_3.11.4-5 python3-packaging_23.2-1 python3-pkg-resources_68.1.2-2 python3-pygments_2.15.1+dfsg-1 python3-requests_2.31.0+dfsg-1 python3-roman_3.3-3 python3-six_1.16.0-4 python3-snowballstemmer_2.2.0-4 python3-sphinx_7.2.6-2 python3-tz_2023.3.post1-1 python3-urllib3_1.26.18-1 python3-yaml_6.0.1-1 python3.11_3.11.6-3 python3.11-minimal_3.11.6-3 raspbian-archive-keyring_20120528.2 rdfind_1.6.0-1 readline-common_8.2-1.3 rpcsvc-proto_1.4.3-1 sbuild-build-depends-main-dummy_0.invalid.0 sed_4.9-1 sensible-utils_0.0.20 sgml-base_1.31 sphinx-common_7.2.6-2 ssl-cert_1.1.2 sysvinit-utils_3.08-3 tar_1.34+dfsg-1.2 tzdata_2023c-10 ucf_3.0043+nmu1 unixodbc-common_2.3.12-1 usr-is-merged_37 util-linux_2.39.2-6 x11-common_1:7.7+23 xml-core_0.18+nmu1 xz-utils_5.4.4-0.1 zlib1g_1:1.2.13.dfsg-3
+------------------------------------------------------------------------------+
| Build |
+------------------------------------------------------------------------------+
Unpack source
-------------
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA512
Format: 3.0 (quilt)
Source: pgrouting
Binary: postgresql-16-pgrouting, postgresql-16-pgrouting-scripts, postgresql-16-pgrouting-doc, postgresql-pgrouting, postgresql-pgrouting-scripts
Architecture: any all
Version: 3.6.0-2
Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
Uploaders: Michael Fladischer <fladi@debian.org>
Homepage: https://www.pgrouting.org
Standards-Version: 4.6.2
Vcs-Browser: https://salsa.debian.org/debian-gis-team/pgrouting
Vcs-Git: https://salsa.debian.org/debian-gis-team/pgrouting.git
Testsuite: autopkgtest
Testsuite-Triggers: postgresql-server-dev-all
Build-Depends: cmake (>= 3.2), debhelper-compat (= 13), dh-sequence-sphinxdoc, graphviz, libboost-graph-dev, libjs-mathjax, postgis, postgresql-server-dev-all, python3-sphinx (>= 1.8), rdfind
Package-List:
postgresql-16-pgrouting deb misc optional arch=any
postgresql-16-pgrouting-doc deb doc optional arch=all
postgresql-16-pgrouting-scripts deb misc optional arch=all
postgresql-pgrouting deb metapackages optional arch=any
postgresql-pgrouting-scripts deb metapackages optional arch=all
Checksums-Sha1:
3aa7333a5ca80020ba27faf30f6ab3f1a141323d 3871079 pgrouting_3.6.0.orig.tar.gz
9ae15e40cae0b5d64ea618c71c9010e4e6aa2f0c 16944 pgrouting_3.6.0-2.debian.tar.xz
Checksums-Sha256:
16b838685b9384e84da03b4ac391b50b930d934c5b2c4b7406f3472183ad0c79 3871079 pgrouting_3.6.0.orig.tar.gz
103793d69c6853725d7a9aed394115e330fac9407131a34fb9e2907228dab089 16944 pgrouting_3.6.0-2.debian.tar.xz
Files:
708e4980026e58e20fb44c0769972be7 3871079 pgrouting_3.6.0.orig.tar.gz
1ea00bb4ace7b37ba9bcc24c79b3636a 16944 pgrouting_3.6.0-2.debian.tar.xz
-----BEGIN PGP SIGNATURE-----
iQIzBAEBCgAdFiEEgYLeQXBWQI1hRlDRZ1DxCuiNSvEFAmVjBvAACgkQZ1DxCuiN
SvE/Eg//Z2xf0mv1xjgbKQ8Elv5HK4R2QHJWRfxF1ipOVVc/cM2Sd4Bqko6UsvQd
HeLGbLbhkg76oeILeKASYn/8jGaOjeMUCSifqYrK/KuwKq93jAayGJ9SGdLGU5Y5
RaFtMq+O+XnWzy+VXQ2orhHKDjhIXwe0k6h2AVeRqe+u203SkoM8BIv4GtesZ6NP
5ghWHwOawZOFAIjCwbAaGOecGr/oZnBcAd6J1TqIMZvxH9gCLEMe4xU330sc8N4R
sslYwRYc8Y0Qagz8wCz5ES+txK4+YQRBkQa9UMixr/Z+YUrMRuAG7WwvzcjlFRyA
CHChfbMO9bxvaeKBxOG+ZelgLhN8ybjgJAW9HSrALu/SuNJg10VHuQwOrbB9FyJa
TWNsTDxD1rXSBYrOL3YeirEFhSl7JNeWTCnvekf3fH96q+XvExWdT9OWRvx81NCa
yCBzvuo8zO5cavmMK0An2543ib96D06h3Tyjkzt1x+BMySApWB1JCS4cfiDpwyBX
3bym/90o4cIsUpwcVnEX0SCPzE0QaN2Xc3ca4BveK/E+cJQgrFAsoggTRwUegrIu
zN9xti7nMJrp2hJ/Z/8/4y2mcYi+WSJNq7HrkjsUQKisi7PTFv1miys88pNldp/d
/ARJjWTqVBxAjmHNp6XDiQODMnVIIGatS0hPkocbVlKEpWcC/Zw=
=HRHE
-----END PGP SIGNATURE-----
gpgv: Signature made Sun Nov 26 08:50:56 2023 UTC
gpgv: using RSA key 8182DE417056408D614650D16750F10AE88D4AF1
gpgv: Can't check signature: No public key
dpkg-source: warning: cannot verify inline signature for ./pgrouting_3.6.0-2.dsc: no acceptable signature found
dpkg-source: info: extracting pgrouting in /<<PKGBUILDDIR>>
dpkg-source: info: unpacking pgrouting_3.6.0.orig.tar.gz
dpkg-source: info: unpacking pgrouting_3.6.0-2.debian.tar.xz
dpkg-source: info: using patch list from debian/patches/series
dpkg-source: info: applying privacy-breach-uses-embedded-file.patch
dpkg-source: info: applying extension-no-version
dpkg-source: info: applying sphinx-version
dpkg-source: info: applying pr2589-size_t-vs-uint64_t.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-544119b5-9bd0-4236-83ea-11d36f27579c
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 pgrouting
dpkg-buildpackage: info: source version 3.6.0-2
dpkg-buildpackage: info: source distribution unstable
dpkg-source --before-build .
dpkg-buildpackage: info: host architecture armhf
debian/rules clean
pg_buildext checkcontrol
supported-versions: WARNING! Unknown distribution ID in /etc/os-release: raspbian
debian found in ID_LIKE, treating as Debian
dh clean
debian/rules override_dh_auto_clean
make[1]: Entering directory '/<<PKGBUILDDIR>>'
pg_buildext clean build-%v
rm -rf build-*/
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
dh_clean
debian/rules binary-arch
dh binary-arch
dh_update_autotools_config -a
dh_autoreconf -a
debian/rules override_dh_auto_configure
make[1]: Entering directory '/<<PKGBUILDDIR>>'
set -e; \
for v in $(pg_buildext supported-versions); do \
cmake -H. -Bbuild-$v -DWITH_DOC=ON -DPOSTGRESQL_PG_CONFIG=/usr/lib/postgresql/$v/bin/pg_config -DCMAKE_VERBOSE_MAKEFILE=1; \
done
supported-versions: WARNING! Unknown distribution ID in /etc/os-release: raspbian
debian found in ID_LIKE, treating as Debian
CMake Deprecation Warning at CMakeLists.txt:1 (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.
-- Setting build type to 'Release' as none was specified.
-- CMAKE_BUILD_TYPE Release
-- 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
-- Could NOT find Git (missing: GIT_EXECUTABLE)
-- DOXYGEN_MINIMUM_VERSION=1.7
-- SPHINX_MINIMUM_VERSION=1.8
-- POSTGRESQL_MINIMUM_VERSION=9.2.0
-- BOOST_MINIMUM_VERSION=1.56.0
-- POSTGIS_MINIMUM_VERSION=2.0.0
-- Found Boost: /usr/lib/arm-linux-gnueabihf/cmake/Boost-1.74.0/BoostConfig.cmake (found suitable version "1.74.0", minimum required is "1.56.0")
-- Performing Test COMPILER_SUPPORTS_CXX11
-- Performing Test COMPILER_SUPPORTS_CXX11 - Success
-- Found Perl: /usr/bin/perl (found version "5.36.0")
-- POSTGRESQL_PG_CONFIG is /usr/lib/postgresql/16/bin/pg_config
-- POSTGRESQL_EXECUTABLE is POSTGRESQL_EXECUTABLE-NOTFOUND
-- POSTGRESQL_VERSION_STRING in FindPostgreSQL.cmake is PostgreSQL 16.1 (Raspbian 16.1-1+rpi1)
-- POSTGRESQL_INCLUDE_DIR: /usr/include/postgresql/16/server
-- POSTGRESQL_LIBRARIES: /usr/lib/arm-linux-gnueabihf
-- POSTGRESQL_VERSION_STRING=PostgreSQL 16.1 (Raspbian 16.1-1+rpi1)
-- POSTGRESQL_VERSION=16.1
-- PGSQL_VERSION=161
-- LIBRARY_INSTALL_PATH /usr/lib/postgresql/16/lib
-- Performing Test C_COMPILER_SUPPORTS_FPIC
-- Performing Test C_COMPILER_SUPPORTS_FPIC - Success
-- Performing Test CXX_COMPILER_SUPPORTS_FPIC
-- Performing Test CXX_COMPILER_SUPPORTS_FPIC - Success
-- Performing Test C_COMPILER_SUPPORTS_ROUNDING_MATH
-- Performing Test C_COMPILER_SUPPORTS_ROUNDING_MATH - Success
-- Performing Test CXX_COMPILER_SUPPORTS_ROUNDING_MATH
-- Performing Test CXX_COMPILER_SUPPORTS_ROUNDING_MATH - Success
-- Developers documentation.
-- Could NOT find Doxygen (missing: DOXYGEN_EXECUTABLE) (Required is at least version "1.7")
-- PROJECT_DOC_TARGETS = html
-- PROJECT_BUILD_LANGUAGES = en
-- SPHINXINTL_LANGUAGE = en
-- Checking for package 'Sphinx'
CMake Warning (dev) at cmake/FindSphinx.cmake:46 (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.
Call Stack (most recent call first):
doc/CMakeLists.txt:143 (find_package)
This warning is for project developers. Use -Wno-dev to suppress it.
-- Found PythonInterp: /usr/bin/python3 (found version "3.11.6")
-- SPHINX_VERSION sphinx-build 7.2.6
-- SPHINX_VERSION 7.2.6
-- Found Sphinx: /usr/bin/sphinx-build (Required is at least version "1.8")
-- PGR_DOCUMENTATION_BUILD_DIR = /<<PKGBUILDDIR>>/build-16/doc
-- Configuring done (2.2s)
-- Generating done (0.2s)
-- Build files have been written to: /<<PKGBUILDDIR>>/build-16
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
debian/rules override_dh_auto_build
make[1]: Entering directory '/<<PKGBUILDDIR>>'
pg_buildext build build-%v
supported-versions: WARNING! Unknown distribution ID in /etc/os-release: raspbian
debian found in ID_LIKE, treating as Debian
### PostgreSQL 16 build ###
make[2]: Entering directory '/<<PKGBUILDDIR>>/build-16'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-16 --check-build-system CMakeFiles/Makefile.cmake 0
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-16/CMakeFiles /<<PKGBUILDDIR>>/build-16//CMakeFiles/progress.marks
make -f CMakeFiles/Makefile2 all
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/circuits /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/circuits /<<PKGBUILDDIR>>/build-16/src/circuits/CMakeFiles/circuits.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 1%] Building C object src/circuits/CMakeFiles/circuits.dir/hawickCircuits.c.o
cd /<<PKGBUILDDIR>>/build-16/src/circuits && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/circuits/CMakeFiles/circuits.dir/hawickCircuits.c.o -MF CMakeFiles/circuits.dir/hawickCircuits.c.o.d -o CMakeFiles/circuits.dir/hawickCircuits.c.o -c /<<PKGBUILDDIR>>/src/circuits/hawickCircuits.c
[ 1%] Building CXX object src/circuits/CMakeFiles/circuits.dir/hawickCircuits_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/circuits && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/circuits/CMakeFiles/circuits.dir/hawickCircuits_driver.cpp.o -MF CMakeFiles/circuits.dir/hawickCircuits_driver.cpp.o.d -o CMakeFiles/circuits.dir/hawickCircuits_driver.cpp.o -c /<<PKGBUILDDIR>>/src/circuits/hawickCircuits_driver.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 1%] Built target circuits
make -f src/dijkstra/CMakeFiles/dijkstra.dir/build.make src/dijkstra/CMakeFiles/dijkstra.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dijkstra /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/dijkstra /<<PKGBUILDDIR>>/build-16/src/dijkstra/CMakeFiles/dijkstra.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/dijkstra/CMakeFiles/dijkstra.dir/build.make src/dijkstra/CMakeFiles/dijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 2%] Building C object src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra.c.o
cd /<<PKGBUILDDIR>>/build-16/src/dijkstra && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra.c.o -MF CMakeFiles/dijkstra.dir/dijkstra.c.o.d -o CMakeFiles/dijkstra.dir/dijkstra.c.o -c /<<PKGBUILDDIR>>/src/dijkstra/dijkstra.c
[ 2%] Building C object src/dijkstra/CMakeFiles/dijkstra.dir/dijkstraVia.c.o
cd /<<PKGBUILDDIR>>/build-16/src/dijkstra && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/dijkstra/CMakeFiles/dijkstra.dir/dijkstraVia.c.o -MF CMakeFiles/dijkstra.dir/dijkstraVia.c.o.d -o CMakeFiles/dijkstra.dir/dijkstraVia.c.o -c /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia.c
[ 3%] Building CXX object src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/dijkstra && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra_driver.cpp.o -MF CMakeFiles/dijkstra.dir/dijkstra_driver.cpp.o.d -o CMakeFiles/dijkstra.dir/dijkstra_driver.cpp.o -c /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/cpp_common/combinations.h:34,
from /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:45:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:152:31:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:152:31:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:156:31:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:156:31:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
[ 3%] Building CXX object src/dijkstra/CMakeFiles/dijkstra.dir/dijkstraVia_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/dijkstra && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/dijkstra/CMakeFiles/dijkstra.dir/dijkstraVia_driver.cpp.o -MF CMakeFiles/dijkstra.dir/dijkstraVia_driver.cpp.o.d -o CMakeFiles/dijkstra.dir/dijkstraVia_driver.cpp.o -c /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:40,
from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:37,
from /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp:34:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:46:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:920:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:926:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:920:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:926:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 3%] Built target dijkstra
make -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/common /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/common /<<PKGBUILDDIR>>/build-16/src/common/CMakeFiles/common.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 3%] Building C object src/common/CMakeFiles/common.dir/postgres_connection.c.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/postgres_connection.c.o -MF CMakeFiles/common.dir/postgres_connection.c.o.d -o CMakeFiles/common.dir/postgres_connection.c.o -c /<<PKGBUILDDIR>>/src/common/postgres_connection.c
[ 4%] Building C object src/common/CMakeFiles/common.dir/e_report.c.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/e_report.c.o -MF CMakeFiles/common.dir/e_report.c.o.d -o CMakeFiles/common.dir/e_report.c.o -c /<<PKGBUILDDIR>>/src/common/e_report.c
[ 4%] Building CXX object src/common/CMakeFiles/common.dir/basePath_SSEC.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/basePath_SSEC.cpp.o -MF CMakeFiles/common.dir/basePath_SSEC.cpp.o.d -o CMakeFiles/common.dir/basePath_SSEC.cpp.o -c /<<PKGBUILDDIR>>/src/common/basePath_SSEC.cpp
/<<PKGBUILDDIR>>/src/common/basePath_SSEC.cpp: In member function ‘pgrouting::Path pgrouting::Path::getSubpath(unsigned int) const’:
/<<PKGBUILDDIR>>/src/common/basePath_SSEC.cpp:160:53: warning: conversion to ‘std::_Deque_iterator<Path_t, const Path_t&, const Path_t*>::difference_type’ {aka ‘int’} from ‘unsigned int’ may change the sign of the result [-Wsign-conversion]
160 | for (auto i = path.begin(); i != path.begin() + j; ++i) {
| ^
[ 5%] Building C object src/common/CMakeFiles/common.dir/check_parameters.c.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/check_parameters.c.o -MF CMakeFiles/common.dir/check_parameters.c.o.d -o CMakeFiles/common.dir/check_parameters.c.o -c /<<PKGBUILDDIR>>/src/common/check_parameters.c
[ 5%] Building C object src/common/CMakeFiles/common.dir/time_msg.c.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/time_msg.c.o -MF CMakeFiles/common.dir/time_msg.c.o.d -o CMakeFiles/common.dir/time_msg.c.o -c /<<PKGBUILDDIR>>/src/common/time_msg.c
[ 6%] Building CXX object src/common/CMakeFiles/common.dir/pgr_assert.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/pgr_assert.cpp.o -MF CMakeFiles/common.dir/pgr_assert.cpp.o.d -o CMakeFiles/common.dir/pgr_assert.cpp.o -c /<<PKGBUILDDIR>>/src/common/pgr_assert.cpp
[ 6%] Building CXX object src/common/CMakeFiles/common.dir/identifier.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/identifier.cpp.o -MF CMakeFiles/common.dir/identifier.cpp.o.d -o CMakeFiles/common.dir/identifier.cpp.o -c /<<PKGBUILDDIR>>/src/common/identifier.cpp
[ 7%] Building CXX object src/common/CMakeFiles/common.dir/basic_vertex.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/basic_vertex.cpp.o -MF CMakeFiles/common.dir/basic_vertex.cpp.o.d -o CMakeFiles/common.dir/basic_vertex.cpp.o -c /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:31:
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = pgrouting::Basic_vertex*; _OutputIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _OutputIterator = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = pgrouting::Basic_vertex*; _OutputIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _OutputIterator = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >]’:
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
1283 | __rotate(_RandomAccessIterator __first,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = pgrouting::Basic_vertex*; _OutputIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _OutputIterator = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ 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<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _RandomAccessIterator2 = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = pgrouting::Basic_vertex*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ 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<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _RandomAccessIterator2 = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = pgrouting::Basic_vertex*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ 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<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _RandomAccessIterator2 = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = pgrouting::Basic_vertex*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/cpp_common/basic_vertex.h:34,
from /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:28:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const pgrouting::Basic_vertex&}; _Tp = pgrouting::Basic_vertex; _Alloc = std::allocator<pgrouting::Basic_vertex>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::Basic_vertex>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/bits/stl_algo.h:69:
/usr/include/c++/13/bits/stl_tempbuf.h: In constructor ‘std::_Temporary_buffer<_ForwardIterator, _Tp>::_Temporary_buffer(_ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >; _Tp = pgrouting::Basic_vertex]’:
/usr/include/c++/13/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
263 | _Temporary_buffer<_ForwardIterator, _Tp>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _BidirectionalIterator2 = pgrouting::Basic_vertex*; _Distance = int]’:
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2363 | __rotate_adaptive(_BidirectionalIterator1 __first,
| ^~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >]’,
inlined from ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _BidirectionalIterator2 = pgrouting::Basic_vertex*; _Distance = int]’ at /usr/include/c++/13/bits/stl_algo.h:2394:20:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __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 = pgrouting::Basic_vertex; _Alloc = std::allocator<pgrouting::Basic_vertex>]’,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(const std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:106:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ 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 = pgrouting::Basic_vertex; _Alloc = std::allocator<pgrouting::Basic_vertex>]’,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(const std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:109:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(const std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:115:25:
/usr/include/c++/13/bits/stl_algo.h:5038:15: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5038 | _TmpBuf __buf(__first, (__last - __first + 1) / 2);
| ^~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(const std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:115:25:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::extract_vertices(const std::vector<Edge_t>&)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(const std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:115:25:
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = pgrouting::Basic_vertex; _Alloc = std::allocator<pgrouting::Basic_vertex>]’,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:73:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ 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 = pgrouting::Basic_vertex; _Alloc = std::allocator<pgrouting::Basic_vertex>]’,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:76:31:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:82:25:
/usr/include/c++/13/bits/stl_algo.h:5038:15: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5038 | _TmpBuf __buf(__first, (__last - __first + 1) / 2);
| ^~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:82:25:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(std::vector<Basic_vertex>, std::vector<Edge_t>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:82:25:
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Distance = int; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:48:25:
/usr/include/c++/13/bits/stl_algo.h:5038:15: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5038 | _TmpBuf __buf(__first, (__last - __first + 1) / 2);
| ^~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Pointer = pgrouting::Basic_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:48:25:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, vector<pgrouting::Basic_vertex> >; _Compare = pgrouting::check_vertices(std::vector<Basic_vertex>)::<lambda(const pgrouting::Basic_vertex&, const pgrouting::Basic_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:48:25:
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 7%] Building CXX object src/common/CMakeFiles/common.dir/xy_vertex.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/xy_vertex.cpp.o -MF CMakeFiles/common.dir/xy_vertex.cpp.o.d -o CMakeFiles/common.dir/xy_vertex.cpp.o -c /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:32:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ 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<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ 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<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ 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<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = pgrouting::XY_vertex*; _OutputIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = pgrouting::XY_vertex*; _OutputIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _OutputIterator = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _RandomAccessIterator2 = pgrouting::XY_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = pgrouting::XY_vertex*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _OutputIterator = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _RandomAccessIterator2 = pgrouting::XY_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = pgrouting::XY_vertex*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >]’:
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
1283 | __rotate(_RandomAccessIterator __first,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/cpp_common/xy_vertex.h:35,
from /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:28:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const pgrouting::XY_vertex&}; _Tp = pgrouting::XY_vertex; _Alloc = std::allocator<pgrouting::XY_vertex>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::XY_vertex>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _BidirectionalIterator2 = pgrouting::XY_vertex*; _Distance = int]’:
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2363 | __rotate_adaptive(_BidirectionalIterator1 __first,
| ^~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >]’,
inlined from ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _BidirectionalIterator2 = pgrouting::XY_vertex*; _Distance = int]’ at /usr/include/c++/13/bits/stl_algo.h:2394:20:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __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 = pgrouting::XY_vertex; _Alloc = std::allocator<pgrouting::XY_vertex>]’,
inlined from ‘std::vector<pgrouting::XY_vertex> pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:95:27:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ 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 = pgrouting::XY_vertex; _Alloc = std::allocator<pgrouting::XY_vertex>]’,
inlined from ‘std::vector<pgrouting::XY_vertex> pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:98:27:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::XY_vertex> pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:104:21:
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::vector<pgrouting::XY_vertex> pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:104:21:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Distance = int; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘size_t pgrouting::check_vertices(std::vector<XY_vertex>)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:71:21:
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Pointer = pgrouting::XY_vertex*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, vector<pgrouting::XY_vertex> >; _Compare = pgrouting::check_vertices(std::vector<XY_vertex>)::<lambda(const pgrouting::XY_vertex&, const pgrouting::XY_vertex&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘size_t pgrouting::check_vertices(std::vector<XY_vertex>)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:71:21:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
[ 8%] Building CXX object src/common/CMakeFiles/common.dir/ch_vertex.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/ch_vertex.cpp.o -MF CMakeFiles/common.dir/ch_vertex.cpp.o.d -o CMakeFiles/common.dir/ch_vertex.cpp.o -c /<<PKGBUILDDIR>>/src/common/ch_vertex.cpp
[ 8%] Building CXX object src/common/CMakeFiles/common.dir/ch_edge.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/ch_edge.cpp.o -MF CMakeFiles/common.dir/ch_edge.cpp.o.d -o CMakeFiles/common.dir/ch_edge.cpp.o -c /<<PKGBUILDDIR>>/src/common/ch_edge.cpp
[ 9%] Building CXX object src/common/CMakeFiles/common.dir/basic_edge.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/basic_edge.cpp.o -MF CMakeFiles/common.dir/basic_edge.cpp.o.d -o CMakeFiles/common.dir/basic_edge.cpp.o -c /<<PKGBUILDDIR>>/src/common/basic_edge.cpp
[ 9%] Building CXX object src/common/CMakeFiles/common.dir/pgr_alloc.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/common/CMakeFiles/common.dir/pgr_alloc.cpp.o -MF CMakeFiles/common.dir/pgr_alloc.cpp.o.d -o CMakeFiles/common.dir/pgr_alloc.cpp.o -c /<<PKGBUILDDIR>>/src/common/pgr_alloc.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 9%] Built target common
make -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/allpairs /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/allpairs /<<PKGBUILDDIR>>/build-16/src/allpairs/CMakeFiles/allpairs.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 9%] Building C object src/allpairs/CMakeFiles/allpairs.dir/floydWarshall.c.o
cd /<<PKGBUILDDIR>>/build-16/src/allpairs && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/allpairs/CMakeFiles/allpairs.dir/floydWarshall.c.o -MF CMakeFiles/allpairs.dir/floydWarshall.c.o.d -o CMakeFiles/allpairs.dir/floydWarshall.c.o -c /<<PKGBUILDDIR>>/src/allpairs/floydWarshall.c
[ 10%] Building CXX object src/allpairs/CMakeFiles/allpairs.dir/floydWarshall_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/allpairs && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/allpairs/CMakeFiles/allpairs.dir/floydWarshall_driver.cpp.o -MF CMakeFiles/allpairs.dir/floydWarshall_driver.cpp.o.d -o CMakeFiles/allpairs.dir/floydWarshall_driver.cpp.o -c /<<PKGBUILDDIR>>/src/allpairs/floydWarshall_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:36,
from /<<PKGBUILDDIR>>/src/allpairs/floydWarshall_driver.cpp:36:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /usr/include/boost/detail/container_fwd.hpp:94,
from /usr/include/boost/container_hash/extensions.hpp:22,
from /usr/include/boost/container_hash/hash.hpp:761,
from /usr/include/boost/functional/hash.hpp:6,
from /usr/include/boost/unordered/unordered_set.hpp:18,
from /usr/include/boost/unordered_set.hpp:17,
from /usr/include/boost/graph/adjacency_list.hpp:20,
from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:40:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_floydWarshall(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/floydWarshall_driver.cpp:69:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_floydWarshall(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/floydWarshall_driver.cpp:69:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_floydWarshall(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/floydWarshall_driver.cpp:74:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_floydWarshall(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/floydWarshall_driver.cpp:74:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
[ 10%] Building C object src/allpairs/CMakeFiles/allpairs.dir/johnson.c.o
cd /<<PKGBUILDDIR>>/build-16/src/allpairs && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/allpairs/CMakeFiles/allpairs.dir/johnson.c.o -MF CMakeFiles/allpairs.dir/johnson.c.o.d -o CMakeFiles/allpairs.dir/johnson.c.o -c /<<PKGBUILDDIR>>/src/allpairs/johnson.c
[ 11%] Building CXX object src/allpairs/CMakeFiles/allpairs.dir/johnson_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/allpairs && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/allpairs/CMakeFiles/allpairs.dir/johnson_driver.cpp.o -MF CMakeFiles/allpairs.dir/johnson_driver.cpp.o.d -o CMakeFiles/allpairs.dir/johnson_driver.cpp.o -c /<<PKGBUILDDIR>>/src/allpairs/johnson_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:36,
from /<<PKGBUILDDIR>>/src/allpairs/johnson_driver.cpp:36:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:42:
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = adjacency_list<vecS, vecS, undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; DistanceMatrix = std::vector<std::vector<double> >; VertexID = vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, unsigned int, pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; BinaryPredicate = std::less<double>; BinaryFunction = pgrouting::Pgr_allpairs<pgrouting::graph::Pgr_base_graph<adjacency_list<vecS, vecS, undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::inf_plus<double>; Infinity = double; DistanceZero = int]’:
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:40:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, unsigned int, pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
40 | bool johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph& g1,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = adjacency_list<vecS, vecS, bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; DistanceMatrix = std::vector<std::vector<double> >; VertexID = vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>; Weight = adj_list_edge_property_map<bidirectional_tag, double, double&, unsigned int, pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; BinaryPredicate = std::less<double>; BinaryFunction = pgrouting::Pgr_allpairs<pgrouting::graph::Pgr_base_graph<adjacency_list<vecS, vecS, bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::inf_plus<double>; Infinity = double; DistanceZero = int]’:
/usr/include/boost/graph/johnson_all_pairs_shortest.hpp:40:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::bidirectional_tag, double, double&, unsigned int, pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63,
from /usr/include/boost/detail/container_fwd.hpp:94,
from /usr/include/boost/container_hash/extensions.hpp:22,
from /usr/include/boost/container_hash/hash.hpp:761,
from /usr/include/boost/functional/hash.hpp:6,
from /usr/include/boost/unordered/unordered_set.hpp:18,
from /usr/include/boost/unordered_set.hpp:17,
from /usr/include/boost/graph/adjacency_list.hpp:20,
from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:40:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_johnson(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/johnson_driver.cpp:67:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_johnson(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/johnson_driver.cpp:67:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_johnson(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/johnson_driver.cpp:72:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_johnson(Edge_t*, size_t, bool, IID_t_rt**, size_t*, char**, char**)’ at /<<PKGBUILDDIR>>/src/allpairs/johnson_driver.cpp:72:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 11%] Built target allpairs
make -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/astar /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/astar /<<PKGBUILDDIR>>/build-16/src/astar/CMakeFiles/astar.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 12%] Building C object src/astar/CMakeFiles/astar.dir/astar.c.o
cd /<<PKGBUILDDIR>>/build-16/src/astar && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/astar/CMakeFiles/astar.dir/astar.c.o -MF CMakeFiles/astar.dir/astar.c.o.d -o CMakeFiles/astar.dir/astar.c.o -c /<<PKGBUILDDIR>>/src/astar/astar.c
[ 12%] Building CXX object src/astar/CMakeFiles/astar.dir/astar_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/astar && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/astar/CMakeFiles/astar.dir/astar_driver.cpp.o -MF CMakeFiles/astar.dir/astar_driver.cpp.o.d -o CMakeFiles/astar.dir/astar_driver.cpp.o -c /<<PKGBUILDDIR>>/src/astar/astar_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/astar/astar.hpp:37,
from /<<PKGBUILDDIR>>/src/astar/astar_driver.cpp:37:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /<<PKGBUILDDIR>>/include/astar/astar.hpp:38:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void pgr_do_astar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/astar/astar_driver.cpp:86:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void pgr_do_astar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/astar/astar_driver.cpp:92:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 12%] Built target astar
make -f src/driving_distance/CMakeFiles/driving_distance.dir/build.make src/driving_distance/CMakeFiles/driving_distance.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/driving_distance /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/driving_distance /<<PKGBUILDDIR>>/build-16/src/driving_distance/CMakeFiles/driving_distance.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/driving_distance/CMakeFiles/driving_distance.dir/build.make src/driving_distance/CMakeFiles/driving_distance.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 13%] Building C object src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_driving_distance.c.o
cd /<<PKGBUILDDIR>>/build-16/src/driving_distance && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_driving_distance.c.o -MF CMakeFiles/driving_distance.dir/many_to_dist_driving_distance.c.o.d -o CMakeFiles/driving_distance.dir/many_to_dist_driving_distance.c.o -c /<<PKGBUILDDIR>>/src/driving_distance/many_to_dist_driving_distance.c
[ 13%] Building C object src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_withPointsDD.c.o
cd /<<PKGBUILDDIR>>/build-16/src/driving_distance && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_withPointsDD.c.o -MF CMakeFiles/driving_distance.dir/many_to_dist_withPointsDD.c.o.d -o CMakeFiles/driving_distance.dir/many_to_dist_withPointsDD.c.o -c /<<PKGBUILDDIR>>/src/driving_distance/many_to_dist_withPointsDD.c
/<<PKGBUILDDIR>>/src/driving_distance/many_to_dist_withPointsDD.c: In function ‘_pgr_withpointsddv4’:
/<<PKGBUILDDIR>>/src/driving_distance/many_to_dist_withPointsDD.c:224:54: warning: conversion to ‘int64’ {aka ‘long long int’} from ‘uint64’ {aka ‘long long unsigned int’} may change the sign of the result [-Wsign-conversion]
224 | values[0] = Int64GetDatum(funcctx->call_cntr + 1);
| ~~~~~~~~~~~~~~~~~~~^~~
[ 14%] Building CXX object src/driving_distance/CMakeFiles/driving_distance.dir/drivedist_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/driving_distance && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/driving_distance/CMakeFiles/driving_distance.dir/drivedist_driver.cpp.o -MF CMakeFiles/driving_distance.dir/drivedist_driver.cpp.o.d -o CMakeFiles/driving_distance.dir/drivedist_driver.cpp.o -c /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:42,
from /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:36:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, long long int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, long long int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:48:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:134:10:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:173:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:134:10:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:173:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:34:
/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/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:445:26:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:445:26:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘bool pgrouting::algorithm::Pgr_dijkstra<G>::execute_drivingDistance(G&, int64_t, double) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:377:26,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:581:41:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:612:28:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘bool pgrouting::algorithm::Pgr_dijkstra<G>::execute_drivingDistance(G&, int64_t, double) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:377:26,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:581:41:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:612:28:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_drivingdist(Edge_t*, size_t, int64_t*, size_t, double, bool, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:81:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_drivingdist(Edge_t*, size_t, int64_t*, size_t, double, bool, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:81:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_drivingdist(Edge_t*, size_t, int64_t*, size_t, double, bool, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:85:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_drivingdist(Edge_t*, size_t, int64_t*, size_t, double, bool, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:85:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
[ 14%] Building CXX object src/driving_distance/CMakeFiles/driving_distance.dir/withPoints_dd_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/driving_distance && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/driving_distance/CMakeFiles/driving_distance.dir/withPoints_dd_driver.cpp.o -MF CMakeFiles/driving_distance.dir/withPoints_dd_driver.cpp.o.d -o CMakeFiles/driving_distance.dir/withPoints_dd_driver.cpp.o -c /<<PKGBUILDDIR>>/src/driving_distance/withPoints_dd_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:42,
from /<<PKGBUILDDIR>>/src/driving_distance/withPoints_dd_driver.cpp:40:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, long long int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, long long int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:48:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:134:10:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:173:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:134:10:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::map<long long int, long long int> detail::get_depth(const G&, V, std::vector<double>&, std::vector<T_V>&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>; V = unsigned int]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:173:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/driving_distance/withPoints_dd_driver.cpp:37:
/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 member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:445:26:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:445:26:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘bool pgrouting::algorithm::Pgr_dijkstra<G>::execute_drivingDistance(G&, int64_t, double) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:377:26,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:581:41:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:612:28:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘bool pgrouting::algorithm::Pgr_dijkstra<G>::execute_drivingDistance(G&, int64_t, double) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:377:26,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:581:41:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithm::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, std::vector<std::map<long long int, long long int> >&, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/drivingDist.hpp:612:28:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 14%] Built target driving_distance
make -f src/ksp/CMakeFiles/ksp.dir/build.make src/ksp/CMakeFiles/ksp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ksp /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/ksp /<<PKGBUILDDIR>>/build-16/src/ksp/CMakeFiles/ksp.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/ksp/CMakeFiles/ksp.dir/build.make src/ksp/CMakeFiles/ksp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 15%] Building C object src/ksp/CMakeFiles/ksp.dir/ksp.c.o
cd /<<PKGBUILDDIR>>/build-16/src/ksp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/ksp/CMakeFiles/ksp.dir/ksp.c.o -MF CMakeFiles/ksp.dir/ksp.c.o.d -o CMakeFiles/ksp.dir/ksp.c.o -c /<<PKGBUILDDIR>>/src/ksp/ksp.c
[ 15%] Building CXX object src/ksp/CMakeFiles/ksp.dir/ksp_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/ksp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/ksp/CMakeFiles/ksp.dir/ksp_driver.cpp.o -MF CMakeFiles/ksp.dir/ksp_driver.cpp.o.d -o CMakeFiles/ksp.dir/ksp_driver.cpp.o -c /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp
In file included from /usr/include/c++/13/deque:65,
from /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:35:
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ 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 ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In file included from /usr/include/c++/13/deque:69:
/usr/include/c++/13/bits/deque.tcc: In function ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’:
/usr/include/c++/13/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
443 | deque<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’ 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 = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; _Tp = pgrouting::Path]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:462:30:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ 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 = std::_Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’ 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 = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; _Tp = pgrouting::Path]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:466:33:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = _Deque_iterator<pgrouting::Path, pgrouting::Path&, pgrouting::Path*>]’:
/usr/include/c++/13/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
163 | uninitialized_copy(_InputIterator __first, _InputIterator __last,
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
/usr/include/c++/13/bits/deque.tcc: In member function ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’:
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
771 | deque<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In file included from /usr/include/c++/13/deque:66:
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:213:27,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
1007 | _M_range_initialize(__first, __last,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1008 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = _Deque_iterator<pgrouting::Path, pgrouting::Path&, pgrouting::Path*>; _Tp = pgrouting::Path]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:609:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:213:27,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
1007 | _M_range_initialize(__first, __last,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1008 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = _Deque_iterator<pgrouting::Path, pgrouting::Path&, pgrouting::Path*>; _Tp = pgrouting::Path]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:609:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
[ 16%] Building C object src/ksp/CMakeFiles/ksp.dir/withPoints_ksp.c.o
cd /<<PKGBUILDDIR>>/build-16/src/ksp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/ksp/CMakeFiles/ksp.dir/withPoints_ksp.c.o -MF CMakeFiles/ksp.dir/withPoints_ksp.c.o.d -o CMakeFiles/ksp.dir/withPoints_ksp.c.o -c /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp.c
[ 16%] Building CXX object src/ksp/CMakeFiles/ksp.dir/withPoints_ksp_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/ksp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/ksp/CMakeFiles/ksp.dir/withPoints_ksp_driver.cpp.o -MF CMakeFiles/ksp.dir/withPoints_ksp_driver.cpp.o.d -o CMakeFiles/ksp.dir/withPoints_ksp_driver.cpp.o -c /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp
In file included from /usr/include/c++/13/deque:65,
from /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp:39:
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ 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 ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In file included from /usr/include/c++/13/deque:69:
/usr/include/c++/13/bits/deque.tcc: In function ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’:
/usr/include/c++/13/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
443 | deque<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’ 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 = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; _Tp = pgrouting::Path]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:462:30:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ 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 = std::_Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’ 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 = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; _Tp = pgrouting::Path]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:466:33:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = _Deque_iterator<pgrouting::Path, pgrouting::Path&, pgrouting::Path*>]’:
/usr/include/c++/13/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
163 | uninitialized_copy(_InputIterator __first, _InputIterator __last,
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
/usr/include/c++/13/bits/deque.tcc: In member function ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’:
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
771 | deque<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In file included from /usr/include/c++/13/deque:66:
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:213:27,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
1007 | _M_range_initialize(__first, __last,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1008 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = _Deque_iterator<pgrouting::Path, pgrouting::Path&, pgrouting::Path*>; _Tp = pgrouting::Path]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:609:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:213:27,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
1007 | _M_range_initialize(__first, __last,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1008 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = _Deque_iterator<pgrouting::Path, pgrouting::Path&, pgrouting::Path*>; _Tp = pgrouting::Path]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:609:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::Yen(G&, int64_t, int64_t, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:108:15,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::Yen(G&, const std::map<long long int, std::set<long long int> >&, size_t, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:268:22:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
[ 17%] Building C object src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath.c.o
cd /<<PKGBUILDDIR>>/build-16/src/ksp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath.c.o -MF CMakeFiles/ksp.dir/turnRestrictedPath.c.o.d -o CMakeFiles/ksp.dir/turnRestrictedPath.c.o -c /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath.c
[ 17%] Building CXX object src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/ksp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath_driver.cpp.o -MF CMakeFiles/ksp.dir/turnRestrictedPath_driver.cpp.o.d -o CMakeFiles/ksp.dir/turnRestrictedPath_driver.cpp.o -c /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/deque:65,
from /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp:33:
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ 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 ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In file included from /usr/include/c++/13/deque:66:
/usr/include/c++/13/bits/stl_deque.h: In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’:
/usr/include/c++/13/bits/stl_deque.h:1003:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
1003 | deque(_InputIterator __first, _InputIterator __last,
| ^~~~~
/usr/include/c++/13/bits/stl_deque.h:1003:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’ 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 = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; _Tp = pgrouting::Path]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:462:30,
inlined from ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/stl_deque.h:1007:23:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ 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 = std::_Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*]’ 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 = _Rb_tree_const_iterator<pgrouting::Path>; _ForwardIterator = pgrouting::Path*; _Tp = pgrouting::Path]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/deque.tcc:466:33,
inlined from ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/stl_deque.h:1007:23:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/deque:69:
/usr/include/c++/13/bits/deque.tcc: In member function ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’:
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
771 | deque<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_deque.h: In function ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’:
/usr/include/c++/13/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
1730 | insert(const_iterator __position, _InputIterator __first,
| ^~~~~~
/usr/include/c++/13/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
In member function ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<pgrouting::Path>; <template-parameter-2-2> = void; _Tp = pgrouting::Path; _Alloc = std::allocator<pgrouting::Path>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23:
/usr/include/c++/13/bits/deque.tcc:638:24: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
638 | _M_insert_aux(__pos, __first, __last, __n);
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp:44:
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_turnRestrictedPath<G>::Yen(G&, int64_t, int64_t, size_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’:
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp:190:31: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
190 | std::deque<Path> solutions(m_solutions.begin(), m_solutions.end());
| ^~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp:33:
In member function ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_turnRestrictedPath<G>::Yen(G&, int64_t, int64_t, size_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp:194:15:
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:213:27: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
213 | std::deque<Path> paths(m_ResultSet.begin(), m_ResultSet.end());
| ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
216 | paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
| ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_turnRestrictedPath<G>::Yen(G&, int64_t, int64_t, size_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’:
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp:176:31: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
176 | std::deque<Path> solutions(m_solutions.begin(), m_solutions.end());
| ^~~~~~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_turnRestrictedPath<G>::Yen(G&, int64_t, int64_t, size_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’:
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp:190:31: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
190 | std::deque<Path> solutions(m_solutions.begin(), m_solutions.end());
| ^~~~~~~~~
In member function ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_ksp<G>::get_results() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_turnRestrictedPath<G>::Yen(G&, int64_t, int64_t, size_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp:194:15:
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:213:27: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
213 | std::deque<Path> paths(m_ResultSet.begin(), m_ResultSet.end());
| ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
216 | paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
| ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:216:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<pgrouting::Path> pgrouting::yen::Pgr_turnRestrictedPath<G>::Yen(G&, int64_t, int64_t, size_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’:
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp:176:31: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<pgrouting::Path>’ changed in GCC 7.1
176 | std::deque<Path> solutions(m_solutions.begin(), m_solutions.end());
| ^~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void do_pgr_turnRestrictedPath(Edge_t*, size_t, Restriction_t*, size_t, int64_t, int64_t, size_t, bool, bool, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp:122:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::Rule*, std::vector<pgrouting::trsp::Rule> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 17%] Built target ksp
make -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/tsp /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/tsp /<<PKGBUILDDIR>>/build-16/src/tsp/CMakeFiles/tsp.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 17%] Building C object src/tsp/CMakeFiles/tsp.dir/euclideanTSP.c.o
cd /<<PKGBUILDDIR>>/build-16/src/tsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/tsp/CMakeFiles/tsp.dir/euclideanTSP.c.o -MF CMakeFiles/tsp.dir/euclideanTSP.c.o.d -o CMakeFiles/tsp.dir/euclideanTSP.c.o -c /<<PKGBUILDDIR>>/src/tsp/euclideanTSP.c
[ 18%] Building C object src/tsp/CMakeFiles/tsp.dir/TSP.c.o
cd /<<PKGBUILDDIR>>/build-16/src/tsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/tsp/CMakeFiles/tsp.dir/TSP.c.o -MF CMakeFiles/tsp.dir/TSP.c.o.d -o CMakeFiles/tsp.dir/TSP.c.o -c /<<PKGBUILDDIR>>/src/tsp/TSP.c
[ 18%] Building CXX object src/tsp/CMakeFiles/tsp.dir/tsp.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/tsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/tsp/CMakeFiles/tsp.dir/tsp.cpp.o -MF CMakeFiles/tsp.dir/tsp.cpp.o.d -o CMakeFiles/tsp.dir/tsp.cpp.o -c /<<PKGBUILDDIR>>/src/tsp/tsp.cpp
/<<PKGBUILDDIR>>/src/tsp/tsp.cpp: In member function ‘std::deque<std::pair<long long int, double> > pgrouting::algorithm::TSP::tsp(int64_t, int64_t, int)’:
/<<PKGBUILDDIR>>/src/tsp/tsp.cpp:233:46: warning: conversion to ‘int’ from ‘boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_weight_t, double>, boost::no_property>, boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_weight_t, double>, boost::no_property, boost::listS>::config::vertices_size_type’ {aka ‘unsigned int’} may change the sign of the result [-Wsign-conversion]
233 | auto dummy_node = add_vertex(num_vertices(graph), graph);
| ~~~~~~~~~~~~^~~~~~~
/<<PKGBUILDDIR>>/src/tsp/tsp.cpp: In constructor ‘pgrouting::algorithm::TSP::TSP(IID_t_rt*, size_t, bool)’:
/<<PKGBUILDDIR>>/src/tsp/tsp.cpp:306:29: warning: conversion to ‘int’ from ‘size_t’ {aka ‘unsigned int’} may change the sign of the result [-Wsign-conversion]
306 | auto v = add_vertex(i, graph);
| ^
/<<PKGBUILDDIR>>/src/tsp/tsp.cpp: In constructor ‘pgrouting::algorithm::TSP::TSP(Coordinate_t*, size_t, bool)’:
/<<PKGBUILDDIR>>/src/tsp/tsp.cpp:394:29: warning: conversion to ‘int’ from ‘size_t’ {aka ‘unsigned int’} may change the sign of the result [-Wsign-conversion]
394 | auto v = add_vertex(i, graph);
| ^
In file included from /<<PKGBUILDDIR>>/src/tsp/tsp.cpp:37:
/usr/include/boost/graph/metric_tsp_approx.hpp: In function ‘void boost::metric_tsp_approx_from_vertex(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, WeightMap, VertexIndexMap, TSPVertexVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_weight_t, double>, no_property>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, unsigned int, property<edge_weight_t, double>, edge_weight_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, unsigned int>; TSPVertexVisitor = tsp_tour_visitor<std::back_insert_iterator<std::vector<unsigned int> > >]’:
/usr/include/boost/graph/metric_tsp_approx.hpp:154:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, unsigned int, boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>’ changed in GCC 7.1
154 | void metric_tsp_approx_from_vertex(const VertexListGraph& g,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 19%] Building CXX object src/tsp/CMakeFiles/tsp.dir/TSP_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/tsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/tsp/CMakeFiles/tsp.dir/TSP_driver.cpp.o -MF CMakeFiles/tsp.dir/TSP_driver.cpp.o.d -o CMakeFiles/tsp.dir/TSP_driver.cpp.o -c /<<PKGBUILDDIR>>/src/tsp/TSP_driver.cpp
[ 19%] Building CXX object src/tsp/CMakeFiles/tsp.dir/euclideanTSP_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/tsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/tsp/CMakeFiles/tsp.dir/euclideanTSP_driver.cpp.o -MF CMakeFiles/tsp.dir/euclideanTSP_driver.cpp.o.d -o CMakeFiles/tsp.dir/euclideanTSP_driver.cpp.o -c /<<PKGBUILDDIR>>/src/tsp/euclideanTSP_driver.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 19%] Built target tsp
make -f src/alpha_shape/CMakeFiles/alpha_shape.dir/build.make src/alpha_shape/CMakeFiles/alpha_shape.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/alpha_shape /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/alpha_shape /<<PKGBUILDDIR>>/build-16/src/alpha_shape/CMakeFiles/alpha_shape.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/alpha_shape/CMakeFiles/alpha_shape.dir/build.make src/alpha_shape/CMakeFiles/alpha_shape.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 19%] Building CXX object src/alpha_shape/CMakeFiles/alpha_shape.dir/pgr_alphaShape.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/alpha_shape && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/alpha_shape/CMakeFiles/alpha_shape.dir/pgr_alphaShape.cpp.o -MF CMakeFiles/alpha_shape.dir/pgr_alphaShape.cpp.o.d -o CMakeFiles/alpha_shape.dir/pgr_alphaShape.cpp.o -c /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/alphaShape/pgr_alphaShape.h:38,
from /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:28:
/usr/include/c++/13/bits/stl_tree.h: In member function ‘std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(const_iterator, const key_type&) [with _Key = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >; _Val = std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>; _KeyOfValue = std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >; _Compare = std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; _Alloc = std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >]’:
/usr/include/c++/13/bits/stl_tree.h:2210:5: note: parameter passing for argument of type ‘std::_Rb_tree<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>, std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >, std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >, std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> > >::const_iterator’ changed in GCC 7.1
2210 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >&>, std::tuple<>}; _Key = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >; _Val = std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>; _KeyOfValue = std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >; _Compare = std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; _Alloc = std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>, std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >, std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >, std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/alphaShape/pgr_alphaShape.h:37:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const boost::geometry::model::d2::point_xy<double, boost::geometry::cs::cartesian>&}; _Tp = boost::geometry::model::d2::point_xy<double>; _Alloc = std::allocator<boost::geometry::model::d2::point_xy<double> >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<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 = boost::geometry::model::d2::point_xy<double>; _Alloc = std::allocator<boost::geometry::model::d2::point_xy<double> >]’,
inlined from ‘static void boost::geometry::traits::push_back<Range>::apply(typename boost::geometry::traits::rvalue_type<Range>::type, const item_type&) [with Range = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/core/mutable_range.hpp:72:24,
inlined from ‘static void boost::geometry::detail::append::append_point<Geometry, Point>::apply(Geometry&, const Point&, int, int) [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Point = boost::geometry::model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:66:43,
inlined from ‘static void boost::geometry::resolve_variant::append<Geometry>::apply(Geometry&, const RangeOrPoint&, int, int) [with RangeOrPoint = boost::geometry::model::d2::point_xy<double>; Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/algorithms/append.hpp:296:56,
inlined from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, int, int) [with Geometry = model::ring<model::d2::point_xy<double>, true, true, std::vector, std::allocator>; RangeOrPoint = model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:371:27,
inlined from ‘pgrouting::Bpoly pgrouting::alphashape::{anonymous}::get_polygon(V, V, const std::vector<T_V>&, const B_G&, std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >&) [with B_G = boost::filtered_graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::alphashape::Pgr_alphaShape::EdgesFilter, boost::keep_all>; V = unsigned int]’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:141:19,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::operator()(double) const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:404:83:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<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 = boost::geometry::model::d2::point_xy<double>; _Alloc = std::allocator<boost::geometry::model::d2::point_xy<double> >]’,
inlined from ‘static void boost::geometry::traits::push_back<Range>::apply(typename boost::geometry::traits::rvalue_type<Range>::type, const item_type&) [with Range = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/core/mutable_range.hpp:72:24,
inlined from ‘static void boost::geometry::detail::append::append_point<Geometry, Point>::apply(Geometry&, const Point&, int, int) [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Point = boost::geometry::model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:66:43,
inlined from ‘static void boost::geometry::resolve_variant::append<Geometry>::apply(Geometry&, const RangeOrPoint&, int, int) [with RangeOrPoint = boost::geometry::model::d2::point_xy<double>; Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/algorithms/append.hpp:296:56,
inlined from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, int, int) [with Geometry = model::ring<model::d2::point_xy<double>, true, true, std::vector, std::allocator>; RangeOrPoint = model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:371:27,
inlined from ‘pgrouting::Bpoly pgrouting::alphashape::{anonymous}::get_polygon(V, V, const std::vector<T_V>&, const B_G&, std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >&) [with B_G = boost::filtered_graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::alphashape::Pgr_alphaShape::EdgesFilter, boost::keep_all>; V = unsigned int]’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:147:23,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::operator()(double) const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:404:83:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<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 = boost::geometry::model::d2::point_xy<double>; _Alloc = std::allocator<boost::geometry::model::d2::point_xy<double> >]’,
inlined from ‘static void boost::geometry::traits::push_back<Range>::apply(typename boost::geometry::traits::rvalue_type<Range>::type, const item_type&) [with Range = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/core/mutable_range.hpp:72:24,
inlined from ‘static void boost::geometry::detail::append::append_point<Geometry, Point>::apply(Geometry&, const Point&, int, int) [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Point = boost::geometry::model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:66:43,
inlined from ‘static void boost::geometry::resolve_variant::append<Geometry>::apply(Geometry&, const RangeOrPoint&, int, int) [with RangeOrPoint = boost::geometry::model::d2::point_xy<double>; Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/algorithms/append.hpp:296:56,
inlined from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, int, int) [with Geometry = model::ring<model::d2::point_xy<double>, true, true, std::vector, std::allocator>; RangeOrPoint = model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:371:27,
inlined from ‘static void boost::geometry::detail::correct_closure::close_or_open_ring<Ring>::apply(Ring&) [with Ring = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/algorithms/correct_closure.hpp:72:29,
inlined from ‘static void boost::geometry::detail::correct::correct_ring<Ring, Predicate>::apply(Ring&, const Strategy&) [with Strategy = boost::geometry::strategy::area::cartesian<>; Ring = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Predicate = std::less]’ at /usr/include/boost/geometry/algorithms/correct.hpp:144:65,
inlined from ‘static void boost::geometry::detail::correct::correct_polygon<Polygon>::apply(Polygon&, const Strategy&) [with Strategy = boost::geometry::strategy::area::cartesian<>; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/correct.hpp:171:21,
inlined from ‘static void boost::geometry::resolve_variant::correct<Geometry>::apply(Geometry&, const Strategy&) [with Strategy = boost::geometry::strategy::area::cartesian<>; Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/correct.hpp:274:43,
inlined from ‘void boost::geometry::correct(Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/correct.hpp:328:46,
inlined from ‘pgrouting::Bpoly pgrouting::alphashape::{anonymous}::get_polygon(V, V, const std::vector<T_V>&, const B_G&, std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >&) [with B_G = boost::filtered_graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::alphashape::Pgr_alphaShape::EdgesFilter, boost::keep_all>; V = unsigned int]’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:151:20,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::operator()(double) const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:404:83:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<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 = boost::geometry::model::d2::point_xy<double>; _Alloc = std::allocator<boost::geometry::model::d2::point_xy<double> >]’,
inlined from ‘static void boost::geometry::traits::push_back<Range>::apply(typename boost::geometry::traits::rvalue_type<Range>::type, const item_type&) [with Range = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/core/mutable_range.hpp:72:24,
inlined from ‘static void boost::geometry::detail::append::append_point<Geometry, Point>::apply(Geometry&, const Point&, int, int) [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Point = boost::geometry::model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:66:43,
inlined from ‘static void boost::geometry::resolve_variant::append<Geometry>::apply(Geometry&, const RangeOrPoint&, int, int) [with RangeOrPoint = boost::geometry::model::d2::point_xy<double>; Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/algorithms/append.hpp:296:56,
inlined from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, int, int) [with Geometry = model::ring<model::d2::point_xy<double>, true, true, std::vector, std::allocator>; RangeOrPoint = model::d2::point_xy<double>]’ at /usr/include/boost/geometry/algorithms/append.hpp:371:27,
inlined from ‘static void boost::geometry::detail::correct_closure::close_or_open_ring<Ring>::apply(Ring&) [with Ring = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/algorithms/correct_closure.hpp:72:29,
inlined from ‘static void boost::geometry::detail::correct::correct_ring<Ring, Predicate>::apply(Ring&, const Strategy&) [with Strategy = boost::geometry::strategy::area::cartesian<>; Ring = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Predicate = std::greater]’ at /usr/include/boost/geometry/algorithms/correct.hpp:144:65,
inlined from ‘static void boost::geometry::detail::correct::correct_polygon<Polygon>::apply(Polygon&, const Strategy&) [with Strategy = boost::geometry::strategy::area::cartesian<>; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/correct.hpp:182:25,
inlined from ‘static void boost::geometry::resolve_variant::correct<Geometry>::apply(Geometry&, const Strategy&) [with Strategy = boost::geometry::strategy::area::cartesian<>; Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/correct.hpp:274:43,
inlined from ‘void boost::geometry::correct(Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/correct.hpp:328:46,
inlined from ‘pgrouting::Bpoly pgrouting::alphashape::{anonymous}::get_polygon(V, V, const std::vector<T_V>&, const B_G&, std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >&) [with B_G = boost::filtered_graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::alphashape::Pgr_alphaShape::EdgesFilter, boost::keep_all>; V = unsigned int]’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:151:20,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::operator()(double) const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:404:83:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<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 = boost::geometry::model::d2::point_xy<double>; _Alloc = std::allocator<boost::geometry::model::d2::point_xy<double> >]’,
inlined from ‘static void boost::geometry::traits::push_back<Range>::apply(typename boost::geometry::traits::rvalue_type<Range>::type, const item_type&) [with Range = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/core/mutable_range.hpp:72:24,
inlined from ‘void boost::geometry::range::push_back(Range&, const typename boost::range_value<T>::type&) [with Range = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’ at /usr/include/boost/geometry/util/range.hpp:186:46,
inlined from ‘static ConvertPointPolicy boost::geometry::detail::conversion::range_to_range<Range1, Range2, Reverse>::apply(const Range1&, Range2&, ConvertPointPolicy) [with ConvertPointPolicy = boost::geometry::detail::conversion::range_to_range<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, false>::default_policy; Range1 = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Range2 = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; bool Reverse = false]’ at /usr/include/boost/geometry/algorithms/convert.hpp:202:29,
inlined from ‘static void boost::geometry::detail::conversion::range_to_range<Range1, Range2, Reverse>::apply(const Range1&, Range2&) [with Range1 = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Range2 = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; bool Reverse = false]’ at /usr/include/boost/geometry/algorithms/convert.hpp:169:14,
inlined from ‘static void boost::geometry::dispatch::convert<Polygon, Ring, boost::geometry::polygon_tag, boost::geometry::ring_tag, DimensionCount, false>::apply(const Polygon&, Ring&) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Ring = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; unsigned int DimensionCount = 2]’ at /usr/include/boost/geometry/algorithms/convert.hpp:453:21,
inlined from ‘static void boost::geometry::resolve_variant::assign<Geometry1, Geometry2>::apply(Geometry1&, const Geometry2&) [with Geometry1 = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Geometry2 = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/assign.hpp:251:55,
inlined from ‘void boost::geometry::assign(Geometry1&, const Geometry2&) [with Geometry1 = model::ring<model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Geometry2 = model::polygon<model::d2::point_xy<double> >]’ at /usr/include/boost/geometry/algorithms/assign.hpp:371:57,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::operator()(double) const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:452:27:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >; _Tp = double; _Compare = std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; _Alloc = std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >]’,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::build_best_alpha() const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:256:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>, std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >, std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >, std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> > >::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::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >; _Tp = double; _Compare = std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; _Alloc = std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >]’,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::build_best_alpha() const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:258:36:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>, std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >, std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >, std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> > >::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::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >; _Tp = double; _Compare = std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; _Alloc = std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >]’,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::build_best_alpha() const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:288:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>, std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >, std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >, std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> > >::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::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >; _Tp = double; _Compare = std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; _Alloc = std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >]’,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::build_best_alpha() const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:303:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>, std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >, std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >, std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> > >::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::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >; _Tp = double; _Compare = std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; _Alloc = std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >]’,
inlined from ‘std::vector<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > pgrouting::alphashape::Pgr_alphaShape::build_best_alpha() const’ at /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:305:55:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double>, std::_Select1st<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> >, std::less<std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >, std::allocator<std::pair<const std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, double> > >::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%] Building C object src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape.c.o
cd /<<PKGBUILDDIR>>/build-16/src/alpha_shape && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape.c.o -MF CMakeFiles/alpha_shape.dir/alphaShape.c.o.d -o CMakeFiles/alpha_shape.dir/alphaShape.c.o -c /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape.c
[ 20%] Building CXX object src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/alpha_shape && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape_driver.cpp.o -MF CMakeFiles/alpha_shape.dir/alphaShape_driver.cpp.o.d -o CMakeFiles/alpha_shape.dir/alphaShape_driver.cpp.o -c /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:37:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/bits/stl_algo.h:61:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Tp = Edge_xy_t; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = Edge_xy_t*; _OutputIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _OutputIterator = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _RandomAccessIterator2 = Edge_xy_t*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = Edge_xy_t*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = Edge_xy_t*; _OutputIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _OutputIterator = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _RandomAccessIterator2 = Edge_xy_t*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = Edge_xy_t*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >]’:
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1283 | __rotate(_RandomAccessIterator __first,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, vector<Edge_xy_t> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2794:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2795:33:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _BidirectionalIterator2 = Edge_xy_t*; _Distance = int]’:
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2363 | __rotate_adaptive(_BidirectionalIterator1 __first,
| ^~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >]’,
inlined from ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _BidirectionalIterator2 = Edge_xy_t*; _Distance = int]’ at /usr/include/c++/13/bits/stl_algo.h:2394:20:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Distance = int; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:100:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ 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<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:100:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ 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<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘void do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:105:25:
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘void do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:105:25:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘void do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:124:25:
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Pointer = Edge_xy_t*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘void do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:124:25:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_xy_t*, vector<Edge_xy_t> >; _Compare = do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)::<lambda(const Edge_xy_t&, const Edge_xy_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void do_alphaShape(Edge_xy_t*, size_t, double, GeomText_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:100:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 20%] Built target alpha_shape
make -f src/bdAstar/CMakeFiles/bdAstar.dir/build.make src/bdAstar/CMakeFiles/bdAstar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdAstar /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/bdAstar /<<PKGBUILDDIR>>/build-16/src/bdAstar/CMakeFiles/bdAstar.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/bdAstar/CMakeFiles/bdAstar.dir/build.make src/bdAstar/CMakeFiles/bdAstar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 21%] Building C object src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar.c.o
cd /<<PKGBUILDDIR>>/build-16/src/bdAstar && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar.c.o -MF CMakeFiles/bdAstar.dir/bdAstar.c.o.d -o CMakeFiles/bdAstar.dir/bdAstar.c.o -c /<<PKGBUILDDIR>>/src/bdAstar/bdAstar.c
[ 21%] Building CXX object src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/bdAstar && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar_driver.cpp.o -MF CMakeFiles/bdAstar.dir/bdAstar_driver.cpp.o.d -o CMakeFiles/bdAstar.dir/bdAstar_driver.cpp.o -c /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:34,
from /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:38:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:35:
/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 = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
529 | 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
/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 std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:117:35:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:106:28,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:107:28,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:112:29,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:113:29,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:126:27,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:130:28,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:143:36,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:148:37,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:117:35,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:156:36,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:106:28,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:107:28,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:112:29,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:113:29,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:123:43,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:126:27,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:130:28,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:143:36,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:148:37,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:117:35,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:156:36,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bdAstar<G>::pgr_bdAstar(V, V, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:93:39,
inlined from ‘std::deque<pgrouting::Path> pgrouting::algorithms::bdastar(G&, const std::map<long long int, std::set<long long int> >&, int, double, double, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:214:28:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:143:36:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:143:36:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdAstar<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>, pgrouting::XY_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdAstar/bdAstar.hpp:117:35:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void pgr_do_bdAstar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:87:102:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_bdAstar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:88:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_bdAstar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:88:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void pgr_do_bdAstar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:92:106:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_bdAstar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:93:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_xy_t; G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::XY_vertex, pgrouting::Basic_edge>; T_V = pgrouting::XY_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void pgr_do_bdAstar(Edge_xy_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, int, double, double, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:93:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 21%] Built target bdAstar
make -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdDijkstra /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/bdDijkstra /<<PKGBUILDDIR>>/build-16/src/bdDijkstra/CMakeFiles/bdDijkstra.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 22%] Building C object src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra.c.o
cd /<<PKGBUILDDIR>>/build-16/src/bdDijkstra && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra.c.o -MF CMakeFiles/bdDijkstra.dir/bdDijkstra.c.o.d -o CMakeFiles/bdDijkstra.dir/bdDijkstra.c.o -c /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra.c
[ 22%] Building CXX object src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/bdDijkstra && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra_driver.cpp.o -MF CMakeFiles/bdDijkstra.dir/bdDijkstra_driver.cpp.o.d -o CMakeFiles/bdDijkstra.dir/bdDijkstra_driver.cpp.o -c /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:35:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Tp = II_t_rt; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_ForwardIterator std::__unique(_ForwardIterator, _ForwardIterator, _BinaryPredicate) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _BinaryPredicate = __gnu_cxx::__ops::_Iter_equal_to_iter]’:
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
905 | __unique(_ForwardIterator __first, _ForwardIterator __last,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Tp = II_t_rt; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = II_t_rt*; _OutputIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = II_t_rt*; _OutputIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _OutputIterator = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _RandomAccessIterator2 = II_t_rt*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = II_t_rt*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _OutputIterator = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2649 | __move_merge(_InputIterator __first1, _InputIterator __last1,
| ^~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2649:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2716 | __merge_sort_with_buffer(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2716:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘void std::__chunk_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2727:34:
/usr/include/c++/13/bits/stl_algo.h:2706:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2706 | std::__insertion_sort(__first, __first + __chunk_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2709 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2709:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _RandomAccessIterator2 = II_t_rt*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2731:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = II_t_rt*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2734:26:
/usr/include/c++/13/bits/stl_algo.h:2684:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2684 | __result = std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2685 | __first + __step_size,
| ~~~~~~~~~~~~~~~~~~~~~~
2686 | __first + __two_step,
| ~~~~~~~~~~~~~~~~~~~~~
2687 | __result, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2692 | std::__move_merge(__first, __first + __step_size,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2693 | __first + __step_size, __last, __result, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2692:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/set:62,
from /usr/include/boost/graph/adjacency_list.hpp:18,
from /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:47,
from /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:34,
from /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:37:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::_M_erase(iterator, iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
195 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
/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 = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
529 | 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
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:106:28:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:107:28:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:112:29:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:113:29:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:106:28:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:107:28:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:112:29:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘void pgrouting::bidirectional::Pgr_bidirectional<G>::initialize() [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:113:29:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Sequence = std::vector<std::pair<double, unsigned int>, std::allocator<std::pair<double, unsigned int> > >; _Compare = std::greater<std::pair<double, unsigned int> >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:139:37:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:116:36:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:139:37:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:116:36:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:139:37,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:148:37:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:116:36,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:156:36:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_backward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:139:37,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:148:37:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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>, std::allocator<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 pgrouting::bidirectional::Pgr_bdDijkstra<G>::explore_forward(const Cost_Vertex_pair&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:116:36,
inlined from ‘pgrouting::Path pgrouting::bidirectional::Pgr_bidirectional<G>::bidirectional(bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:156:36:
/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)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, vector<II_t_rt> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘_RandomAccessIterator std::_V2::__rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, std::random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >]’:
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1283 | __rotate(_RandomAccessIterator __first,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:1283:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _BidirectionalIterator2 = II_t_rt*; _Distance = int]’:
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2363 | __rotate_adaptive(_BidirectionalIterator1 __first,
| ^~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2363:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >]’,
inlined from ‘_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _BidirectionalIterator2 = II_t_rt*; _Distance = int]’ at /usr/include/c++/13/bits/stl_algo.h:2394:20:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2477 | __merge_without_buffer(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2477:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In function ‘_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >]’,
inlined from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2517:15:
/usr/include/c++/13/bits/stl_algo.h:1399:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1399 | return std::__rotate(__first, __middle, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
1400 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2518:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2518 | std::__merge_without_buffer(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2519 | __len11, __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2520:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2520 | std::__merge_without_buffer(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2521 | __len1 - __len11, __len2 - __len22, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2785 | __inplace_stable_sort(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2785:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2790:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2790 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2794:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2794 | std::__inplace_stable_sort(__first, __middle, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2795:33: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2795 | std::__inplace_stable_sort(__middle, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2796:34: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2796 | std::__merge_without_buffer(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2797 | __middle - __first,
| ~~~~~~~~~~~~~~~~~~~
2798 | __last - __middle,
| ~~~~~~~~~~~~~~~~~~
2799 | __comp);
| ~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:66:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:66:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:68:28:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:67:22:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:71:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:71:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:73:28:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:72:22:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:92:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:92:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:96:25:
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:96:25:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2401 | __merge_adaptive(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2401:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__merge_adaptive_resize(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2424 | __merge_adaptive_resize(_BidirectionalIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2424:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2432:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2432 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2433 | __len1, __len2, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2460:37: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2460 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2461 | _Distance(__len1 - __len11), __len22,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2462 | __buffer, __buffer_size);
| ~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2463:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2463 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2464 | __len11, __len22,
| ~~~~~~~~~~~~~~~~~
2465 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2466:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2466 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2467 | _Distance(__len1 - __len11),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2468 | _Distance(__len2 - __len22),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2469 | __buffer, __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2758 | __stable_sort_adaptive_resize(_RandomAccessIterator __first,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2758:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h:2767:45: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2767 | std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2768 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2769:45: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2769 | std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
2770 | __buffer_size, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2771:39: note: parameter passing for argument of type ‘const __gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2771 | std::__merge_adaptive_resize(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2772 | _Distance(__middle - __first),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2773 | _Distance(__last - __middle),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2774 | __buffer, __buffer_size,
| ~~~~~~~~~~~~~~~~~~~~~~~~
2775 | __comp);
| ~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__stable_sort_adaptive_resize(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:2778:29:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:66:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:66:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:68:28:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:67:22:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:71:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:71:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:73:28:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:72:22:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:92:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:92:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:96:25:
/usr/include/c++/13/bits/stl_algo.h:5045:35: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
5045 | std::__inplace_stable_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5047:43: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
5047 | std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
5048 | _DistanceType(__buf.size()), __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Pointer = II_t_rt*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
inlined from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<{anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/13/bits/stl_algo.h:5041:29,
inlined from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = {anonymous}::pgr_bdDijkstra<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >(pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:5119:36,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bdDijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::ostream&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:96:25:
/usr/include/c++/13/bits/stl_algo.h:2747:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2747 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2748:36: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2748 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:2750:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
2750 | std::__merge_adaptive(__first, __middle, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
2751 | __middle - __first, __last - __middle,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2752 | __buffer, __comp);
| ~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63,
from /usr/include/boost/detail/container_fwd.hpp:94,
from /usr/include/boost/container_hash/extensions.hpp:22,
from /usr/include/boost/container_hash/hash.hpp:761,
from /usr/include/boost/functional/hash.hpp:6,
from /usr/include/boost/unordered/unordered_set.hpp:18,
from /usr/include/boost/unordered_set.hpp:17,
from /usr/include/boost/graph/adjacency_list.hpp:20:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bdDijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:181:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bdDijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:181:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bdDijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:191:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bdDijkstra(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:191:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 22%] Built target bdDijkstra
make -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/trsp /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/trsp /<<PKGBUILDDIR>>/build-16/src/trsp/CMakeFiles/trsp.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 23%] Building C object src/trsp/CMakeFiles/trsp.dir/trsp.c.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trsp.c.o -MF CMakeFiles/trsp.dir/trsp.c.o.d -o CMakeFiles/trsp.dir/trsp.c.o -c /<<PKGBUILDDIR>>/src/trsp/trsp.c
[ 23%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trsp_core.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trsp_core.cpp.o -MF CMakeFiles/trsp.dir/trsp_core.cpp.o.d -o CMakeFiles/trsp.dir/trsp_core.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/trsp_core.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/trsp/trsp_core.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {long long int}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {long long int}; _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘int trsp_edge_wrapper(Edge_t*, size_t, restrict_t*, size_t, int64_t, double, int64_t, double, bool, bool, path_element_tt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_core.cpp:62:26:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = {long long int}; _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘int trsp_edge_wrapper(Edge_t*, size_t, restrict_t*, size_t, int64_t, double, int64_t, double, bool, bool, path_element_tt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_core.cpp:64:30:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
[ 24%] Building CXX object src/trsp/CMakeFiles/trsp.dir/GraphDefinition.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/GraphDefinition.cpp.o -MF CMakeFiles/trsp.dir/GraphDefinition.cpp.o.d -o CMakeFiles/trsp.dir/GraphDefinition.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp
In file included from /usr/include/c++/13/queue:64,
from /<<PKGBUILDDIR>>/include/trsp/GraphDefinition.h:35,
from /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:26:
/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, pair<long long int, bool> >*, vector<pair<double, pair<long long int, bool> > > >; _Distance = int; _Tp = pair<double, pair<long long int, bool> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<pair<double, pair<long long int, bool> > > >]’:
/usr/include/c++/13/bits/stl_heap.h:135:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, std::pair<long long int, bool> >*, std::vector<std::pair<double, std::pair<long long int, bool> > > >’ changed in GCC 7.1
135 | __push_heap(_RandomAccessIterator __first,
| ^~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/trsp/GraphDefinition.h:34:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long int> > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<Rule> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<Rule> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<Rule> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<Rule> >, std::_Select1st<std::pair<const long long int, std::vector<Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<Rule> > > >::const_iterator’ changed in GCC 7.1
/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<long long int&&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, long long int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, long long int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<Rule>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<Rule> > >]’,
inlined from ‘double GraphDefinition::getRestrictionCost(int64, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:123:53:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<Rule> >, std::_Select1st<std::pair<const long long int, std::vector<Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<Rule> > > >::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>>/include/trsp/GraphDefinition.h:33:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const path_element_tt&}; _Tp = path_element_tt; _Alloc = std::allocator<path_element_tt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<path_element_tt>::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 = path_element_tt; _Alloc = std::allocator<path_element_tt>]’,
inlined from ‘double GraphDefinition::construct_path(int64, int64)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:89:28:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<path_element_tt*, std::vector<path_element_tt> >’ 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 = path_element_tt; _Alloc = std::allocator<path_element_tt>]’,
inlined from ‘double GraphDefinition::construct_path(int64, int64)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:107:24:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<path_element_tt*, std::vector<path_element_tt> >’ 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 long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:562:56,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:558:6:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:566:61,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:558:6:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:570:59,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:558:6:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:575:54:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:578:61:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::connectEdge(GraphEdgeInfo&, GraphEdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:582:59:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘bool GraphDefinition::addEdge(Edge_t)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:651:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::addEdge(Edge_t)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:651:46:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘bool GraphDefinition::addEdge(Edge_t)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:652:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘bool GraphDefinition::addEdge(Edge_t)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:652:46:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = {Rule}; _Tp = Rule; _Alloc = std::allocator<Rule>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Rule>::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 = {std::pair<double, std::pair<long long int, bool> >}; _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, std::pair<long long int, bool> > >::iterator’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, std::pair<long long int, bool> >}; _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’ 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, std::pair<long long int, bool> >; _Sequence = std::vector<std::pair<double, std::pair<long long int, bool> > >; _Compare = std::greater<std::pair<double, std::pair<long long int, bool> > >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void GraphDefinition::explore(int64, GraphEdgeInfo&, bool, LongVector&, std::priority_queue<std::pair<double, std::pair<long long int, bool> >, std::vector<std::pair<double, std::pair<long long int, bool> > >, std::greater<std::pair<double, std::pair<long long int, bool> > > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:178:29:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, std::pair<long long int, bool> >*, std::vector<std::pair<double, std::pair<long long int, bool> > > >’ 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, std::pair<long long int, bool> >}; _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’ 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, std::pair<long long int, bool> >; _Sequence = std::vector<std::pair<double, std::pair<long long int, bool> > >; _Compare = std::greater<std::pair<double, std::pair<long long int, bool> > >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void GraphDefinition::explore(int64, GraphEdgeInfo&, bool, LongVector&, std::priority_queue<std::pair<double, std::pair<long long int, bool> >, std::vector<std::pair<double, std::pair<long long int, bool> > >, std::greater<std::pair<double, std::pair<long long int, bool> > > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:195:29:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, std::pair<long long int, bool> >*, std::vector<std::pair<double, std::pair<long long int, bool> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘int GraphDefinition::my_dijkstra3(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:400:57:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, std::pair<long long int, bool> >}; _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’ 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, std::pair<long long int, bool> >; _Sequence = std::vector<std::pair<double, std::pair<long long int, bool> > >; _Compare = std::greater<std::pair<double, std::pair<long long int, bool> > >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘int GraphDefinition::my_dijkstra3(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:410:25:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, std::pair<long long int, bool> >*, std::vector<std::pair<double, std::pair<long long int, bool> > > >’ 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, std::pair<long long int, bool> >}; _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’ 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, std::pair<long long int, bool> >; _Sequence = std::vector<std::pair<double, std::pair<long long int, bool> > >; _Compare = std::greater<std::pair<double, std::pair<long long int, bool> > >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘int GraphDefinition::my_dijkstra3(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:419:25:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, std::pair<long long int, bool> >*, std::vector<std::pair<double, std::pair<long long int, bool> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = path_element_tt; _Alloc = std::allocator<path_element_tt>]’,
inlined from ‘int GraphDefinition::my_dijkstra3(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:472:28:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<path_element_tt*, std::vector<path_element_tt> >’ 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:320:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<Rule>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<Rule> > >]’,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:324:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<Rule> >, std::_Select1st<std::pair<const long long int, std::vector<Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<Rule> > > >::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 ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {Rule}; _Tp = Rule; _Alloc = std::allocator<Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = Rule; _Alloc = std::allocator<Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:324:48:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Rule*, std::vector<Rule> >’ 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 = {Rule}; _Tp = Rule; _Alloc = std::allocator<Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = Rule; _Alloc = std::allocator<Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:329:32:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Rule*, std::vector<Rule> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:335:58:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:338:50:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<Rule>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<Rule> > >]’,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:340:45:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<Rule> >, std::_Select1st<std::pair<const long long int, std::vector<Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<Rule> > > >::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 ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {Rule}; _Tp = Rule; _Alloc = std::allocator<Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = Rule; _Alloc = std::allocator<Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:340:56:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Rule*, std::vector<Rule> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<Rule>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<Rule> > >]’,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:348:66:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<Rule> >, std::_Select1st<std::pair<const long long int, std::vector<Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<Rule> > > >::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 = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘int GraphDefinition::my_dijkstra2(Edge_t*, size_t, int64, int64, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:349:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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[](key_type&&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘int GraphDefinition::my_dijkstra1(Edge_t*, size_t, int64, double, int64, double, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:223:96:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘int GraphDefinition::my_dijkstra1(Edge_t*, size_t, int64, double, int64, double, bool, bool, path_element_tt**, size_t*, char**, std::vector<std::pair<double, std::vector<long long int> > >&)’ at /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:261:90:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 24%] Building C object src/trsp/CMakeFiles/trsp.dir/new_trsp.c.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/new_trsp.c.o -MF CMakeFiles/trsp.dir/new_trsp.c.o.d -o CMakeFiles/trsp.dir/new_trsp.c.o -c /<<PKGBUILDDIR>>/src/trsp/new_trsp.c
[ 25%] Building CXX object src/trsp/CMakeFiles/trsp.dir/edgeInfo.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/edgeInfo.cpp.o -MF CMakeFiles/trsp.dir/edgeInfo.cpp.o.d -o CMakeFiles/trsp.dir/edgeInfo.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/edgeInfo.cpp
[ 25%] Building CXX object src/trsp/CMakeFiles/trsp.dir/pgr_trspHandler.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/pgr_trspHandler.cpp.o -MF CMakeFiles/trsp.dir/pgr_trspHandler.cpp.o.d -o CMakeFiles/trsp.dir/pgr_trspHandler.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/trsp/pgr_trspHandler.h:33,
from /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:28:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<pgrouting::trsp::Rule> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<pgrouting::trsp::Rule> >, std::_Select1st<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, long long int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, long long int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘void pgrouting::trsp::Pgr_trspHandler::renumber_edges(Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:101:40:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘void pgrouting::trsp::Pgr_trspHandler::renumber_edges(Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:105:40:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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<>());
| ~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<unsigned int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<unsigned int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<unsigned int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<unsigned int> >, std::_Select1st<std::pair<const long long int, std::vector<unsigned int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<unsigned int> > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘void pgrouting::trsp::Pgr_trspHandler::renumber_edges(Edge_t*, size_t, std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:121:40:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘void pgrouting::trsp::Pgr_trspHandler::renumber_edges(Edge_t*, size_t, std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:137:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = std::vector<pgrouting::trsp::Rule>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > >]’,
inlined from ‘double pgrouting::trsp::Pgr_trspHandler::getRestrictionCost(int64_t, const pgrouting::trsp::EdgeInfo&, bool)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:209:40:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<pgrouting::trsp::Rule> >, std::_Select1st<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > > >::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>>/include/trsp/pgr_trspHandler.h:31:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const pgrouting::trsp::Rule&}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<pgrouting::trsp::Rule>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > >]’,
inlined from ‘int pgrouting::trsp::Pgr_trspHandler::initialize_restrictions(const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:303:37:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<pgrouting::trsp::Rule> >, std::_Select1st<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<pgrouting::trsp::Rule> > > >::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 = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’,
inlined from ‘int pgrouting::trsp::Pgr_trspHandler::initialize_restrictions(const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:303:48:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::Rule*, std::vector<pgrouting::trsp::Rule> >’ 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 = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’,
inlined from ‘int pgrouting::trsp::Pgr_trspHandler::initialize_restrictions(const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:306:24:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::Rule*, std::vector<pgrouting::trsp::Rule> >’ 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 pgrouting::trsp::EdgeInfo&}; _Tp = pgrouting::trsp::EdgeInfo; _Alloc = std::allocator<pgrouting::trsp::EdgeInfo>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::EdgeInfo>::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 = pgrouting::trsp::EdgeInfo; _Alloc = std::allocator<pgrouting::trsp::EdgeInfo>]’,
inlined from ‘bool pgrouting::trsp::Pgr_trspHandler::addEdge(Edge_t, bool)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:625:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::EdgeInfo*, std::vector<pgrouting::trsp::EdgeInfo> >’ 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 = long long int; _Tp = std::vector<unsigned int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<unsigned int> > >]’,
inlined from ‘bool pgrouting::trsp::Pgr_trspHandler::addEdge(Edge_t, bool)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:657:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<unsigned int> >, std::_Select1st<std::pair<const long long int, std::vector<unsigned int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<unsigned 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 = long long int; _Tp = std::vector<unsigned int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<unsigned int> > >]’,
inlined from ‘bool pgrouting::trsp::Pgr_trspHandler::addEdge(Edge_t, bool)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:658:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<unsigned int> >, std::_Select1st<std::pair<const long long int, std::vector<unsigned int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<unsigned 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘pgrouting::trsp::Pgr_trspHandler::Pgr_trspHandler(Edge_t*, size_t, bool, const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:57:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘pgrouting::trsp::Pgr_trspHandler::Pgr_trspHandler(Edge_t*, size_t, const std::vector<Edge_t>&, bool, const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:79:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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<>());
| ~~~~~~~~~~~~~~~
/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, std::pair<long long int, bool> >}; _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, std::pair<long long int, bool> > >::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, std::pair<long long int, bool> >}; _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, std::pair<long long int, bool> >; _Alloc = std::allocator<std::pair<double, std::pair<long long int, bool> > >]’ 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, std::pair<long long int, bool> >; _Sequence = std::vector<std::pair<double, std::pair<long long int, bool> > >; _Compare = std::greater<std::pair<double, std::pair<long long int, bool> > >]’ at /usr/include/c++/13/bits/stl_queue.h:748:13,
inlined from ‘void pgrouting::trsp::Pgr_trspHandler::add_to_que(double, size_t, bool)’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:401:13:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, std::pair<long long int, bool> >*, std::vector<std::pair<double, std::pair<long long int, bool> > > >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<unsigned int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<unsigned int> > >]’,
inlined from ‘void pgrouting::trsp::Pgr_trspHandler::initialize_que()’ at /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:413:56:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<unsigned int> >, std::_Select1st<std::pair<const long long int, std::vector<unsigned int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<unsigned 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<>());
| ~~~~~~~~~~~~~~~
[ 26%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trsp_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trsp_driver.cpp.o -MF CMakeFiles/trsp.dir/trsp_driver.cpp.o.d -o CMakeFiles/trsp.dir/trsp_driver.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:38:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:39:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:32:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_trsp(Edge_t*, size_t, Restriction_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:137:61:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_trsp(Edge_t*, size_t, Restriction_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:144:65:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void do_trsp(Edge_t*, size_t, Restriction_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:174:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::Rule*, std::vector<pgrouting::trsp::Rule> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 26%] Building C object src/trsp/CMakeFiles/trsp.dir/trsp_withPoints.c.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trsp_withPoints.c.o -MF CMakeFiles/trsp.dir/trsp_withPoints.c.o.d -o CMakeFiles/trsp.dir/trsp_withPoints.c.o -c /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints.c
[ 27%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trsp_withPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trsp_withPoints_driver.cpp.o -MF CMakeFiles/trsp.dir/trsp_withPoints_driver.cpp.o.d -o CMakeFiles/trsp.dir/trsp_withPoints_driver.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:39:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:40:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:33:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_trsp_withPoints(Edge_t*, size_t, Restriction_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, char, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:161:61:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_trsp_withPoints(Edge_t*, size_t, Restriction_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, char, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:169:65:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void do_trsp_withPoints(Edge_t*, size_t, Restriction_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, char, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:218:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::Rule*, std::vector<pgrouting::trsp::Rule> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 27%] Building C object src/trsp/CMakeFiles/trsp.dir/trspVia.c.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trspVia.c.o -MF CMakeFiles/trsp.dir/trspVia.c.o.d -o CMakeFiles/trsp.dir/trspVia.c.o -c /<<PKGBUILDDIR>>/src/trsp/trspVia.c
[ 28%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trspVia_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trspVia_driver.cpp.o -MF CMakeFiles/trsp.dir/trspVia_driver.cpp.o.d -o CMakeFiles/trsp.dir/trspVia_driver.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/trspVia_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:40,
from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:37,
from /<<PKGBUILDDIR>>/src/trsp/trspVia_driver.cpp:35:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/trsp/trspVia_driver.cpp:32:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:46:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:920:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:926:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:920:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T_E&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:926:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void do_trspVia(Edge_t*, size_t, Restriction_t*, size_t, int64_t*, size_t, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trspVia_driver.cpp:211:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::Rule*, std::vector<pgrouting::trsp::Rule> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 28%] Building C object src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints.c.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints.c.o -MF CMakeFiles/trsp.dir/trspVia_withPoints.c.o.d -o CMakeFiles/trsp.dir/trspVia_withPoints.c.o -c /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints.c
[ 29%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints_driver.cpp.o -MF CMakeFiles/trsp.dir/trspVia_withPoints_driver.cpp.o.d -o CMakeFiles/trsp.dir/trspVia_withPoints_driver.cpp.o -c /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:40,
from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:37,
from /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp:32:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:46:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp:29:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_trspVia_withPoints(Edge_t*, size_t, Restriction_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t*, size_t, bool, char, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp:202:61:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_trspVia_withPoints(Edge_t*, size_t, Restriction_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t*, size_t, bool, char, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp:213:65:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {pgrouting::trsp::Rule}; _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::trsp::Rule; _Alloc = std::allocator<pgrouting::trsp::Rule>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void do_trspVia_withPoints(Edge_t*, size_t, Restriction_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t*, size_t, bool, char, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp:250:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::trsp::Rule*, std::vector<pgrouting::trsp::Rule> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 29%] Built target trsp
make -f src/max_flow/CMakeFiles/max_flow.dir/build.make src/max_flow/CMakeFiles/max_flow.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/max_flow /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/max_flow /<<PKGBUILDDIR>>/build-16/src/max_flow/CMakeFiles/max_flow.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/max_flow/CMakeFiles/max_flow.dir/build.make src/max_flow/CMakeFiles/max_flow.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 30%] Building C object src/max_flow/CMakeFiles/max_flow.dir/max_flow.c.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/max_flow.c.o -MF CMakeFiles/max_flow.dir/max_flow.c.o.d -o CMakeFiles/max_flow.dir/max_flow.c.o -c /<<PKGBUILDDIR>>/src/max_flow/max_flow.c
[ 30%] Building C object src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow.c.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow.c.o -MF CMakeFiles/max_flow.dir/minCostMaxFlow.c.o.d -o CMakeFiles/max_flow.dir/minCostMaxFlow.c.o -c /<<PKGBUILDDIR>>/src/max_flow/minCostMaxFlow.c
[ 31%] Building C object src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching.c.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching.c.o -MF CMakeFiles/max_flow.dir/maximum_cardinality_matching.c.o.d -o CMakeFiles/max_flow.dir/maximum_cardinality_matching.c.o -c /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching.c
[ 32%] Building C object src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths.c.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths.c.o -MF CMakeFiles/max_flow.dir/edge_disjoint_paths.c.o.d -o CMakeFiles/max_flow.dir/edge_disjoint_paths.c.o -c /<<PKGBUILDDIR>>/src/max_flow/edge_disjoint_paths.c
[ 32%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/max_flow_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/max_flow_driver.cpp.o -MF CMakeFiles/max_flow.dir/max_flow_driver.cpp.o.d -o CMakeFiles/max_flow.dir/max_flow_driver.cpp.o -c /<<PKGBUILDDIR>>/src/max_flow/max_flow_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/src/max_flow/max_flow_driver.cpp:34:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(const_iterator, const key_type&) [with _Key = long long int; _Val = long long int; _KeyOfValue = std::_Identity<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/stl_tree.h:2210:5: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator’ changed in GCC 7.1
2210 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:39,
from /<<PKGBUILDDIR>>/src/max_flow/max_flow_driver.cpp:36:
/usr/include/boost/graph/push_relabel_max_flow.hpp: In constructor ‘boost::detail::push_relabel<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap, FlowValue>::push_relabel(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, vertex_descriptor, vertex_descriptor, VertexIndexMap) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >; EdgeCapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, long long int, const long long int&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_reverse_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, unsigned int>; FlowValue = long long int]’:
/usr/include/boost/graph/push_relabel_max_flow.hpp:124:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, const long long int&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_capacity_t>’ changed in GCC 7.1
124 | push_relabel(Graph& g_, EdgeCapacityMap cap,
| ^~~~~~~~~~~~
/usr/include/boost/graph/push_relabel_max_flow.hpp:124:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
In file included from /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:41:
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp: In constructor ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >; EdgeCapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, long long int, const long long int&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_reverse_t>; PredecessorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>&, boost::vertex_predecessor_t>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DistanceMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, long long int, long long int&, boost::vertex_distance_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, unsigned int>]’:
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:92:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, const long long int&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_capacity_t>’ changed in GCC 7.1
92 | bk_max_flow(Graph& g, EdgeCapacityMap cap, ResidualCapacityEdgeMap res,
| ^~~~~~~~~~~
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:92:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:92:9: note: parameter passing for argument of type ‘boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, long long int, long long int&, boost::vertex_distance_t>’ changed in GCC 7.1
In function ‘typename boost::property_traits<IndexMap>::value_type boost::push_relabel_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, VertexIndexMap) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long long int, const long long int&, unsigned int, const property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long long int, long long int&, unsigned int, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, unsigned int>, const detail::edge_desc_impl<directed_tag, unsigned int>&, unsigned int, const property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_reverse_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, unsigned int>]’,
inlined from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::push_relabel_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property]’ at /usr/include/boost/graph/push_relabel_max_flow.hpp:839:33,
inlined from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::push_relabel_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >]’ at /usr/include/boost/graph/push_relabel_max_flow.hpp:855:33,
inlined from ‘int64_t pgrouting::graph::PgrFlowGraph::push_relabel()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:73:45,
inlined from ‘void do_pgr_max_flow(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, int, bool, Flow_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/max_flow_driver.cpp:111:44:
/usr/include/boost/graph/push_relabel_max_flow.hpp:820:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
820 | algo(g, cap, res, rev, src, sink, index_map);
| ^~~~
In function ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long long int, const long long int&, unsigned int, const property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long long int, long long int&, unsigned int, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, unsigned int>, const detail::edge_desc_impl<directed_tag, unsigned int>&, unsigned int, const property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_reverse_t>; PredecessorMap = vec_adj_list_vertex_property_map<adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >*, detail::edge_desc_impl<directed_tag, unsigned int>, detail::edge_desc_impl<directed_tag, unsigned int>&, vertex_predecessor_t>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >*, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >*, long long int, long long int&, vertex_distance_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, unsigned int>]’,
inlined from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property]’ at /usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1039:38,
inlined from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >]’ at /usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1063:38,
inlined from ‘int64_t pgrouting::graph::PgrFlowGraph::boykov_kolmogorov()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:91:50,
inlined from ‘void do_pgr_max_flow(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, int, bool, Flow_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/max_flow_driver.cpp:115:49:
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: note: parameter passing for argument of type ‘boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, long long int, long long int&, boost::vertex_distance_t>’ changed in GCC 7.1
[ 33%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching_driver.cpp.o -MF CMakeFiles/max_flow.dir/maximum_cardinality_matching_driver.cpp.o.d -o CMakeFiles/max_flow.dir/maximum_cardinality_matching_driver.cpp.o -c /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:40,
from /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp: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<Only_int_rt*, vector<Only_int_rt> >; _Distance = int; _Tp = Only_int_rt; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Only_int_rt*, std::vector<Only_int_rt> >’ 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<Only_int_rt*, vector<Only_int_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Only_int_rt*, std::vector<Only_int_rt> >’ 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<Only_int_rt*, std::vector<Only_int_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:36:
/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 unsigned int&>, std::tuple<>}; _Key = unsigned int; _Val = std::pair<const unsigned int, long long int>; _KeyOfValue = std::_Select1st<std::pair<const unsigned int, long long int> >; _Compare = std::less<unsigned int>; _Alloc = std::allocator<std::pair<const unsigned int, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<unsigned int, std::pair<const unsigned int, long long int>, std::_Select1st<std::pair<const unsigned int, long long int> >, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, long long int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp:37:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Only_int_rt&}; _Tp = Only_int_rt; _Alloc = std::allocator<Only_int_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Only_int_rt>::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<Only_int_rt*, vector<Only_int_rt> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Only_int_rt*, std::vector<Only_int_rt> >’ 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<Only_int_rt*, std::vector<Only_int_rt> >’ 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<Only_int_rt*, std::vector<Only_int_rt> >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = unsigned int; _Tp = long long int; _Compare = std::less<unsigned int>; _Alloc = std::allocator<std::pair<const unsigned int, long long int> >]’,
inlined from ‘int64_t pgrouting::flow::PgrCardinalityGraph::get_vertex_id(V)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:73:23,
inlined from ‘std::vector<Only_int_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:133:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<unsigned int, std::pair<const unsigned int, long long int>, std::_Select1st<std::pair<const unsigned int, long long int> >, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, long long 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 = unsigned int; _Tp = long long int; _Compare = std::less<unsigned int>; _Alloc = std::allocator<std::pair<const unsigned int, long long int> >]’,
inlined from ‘int64_t pgrouting::flow::PgrCardinalityGraph::get_vertex_id(V)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:73:23,
inlined from ‘std::vector<Only_int_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:134:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<unsigned int, std::pair<const unsigned int, long long int>, std::_Select1st<std::pair<const unsigned int, long long int> >, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, long long 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 file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Only_int_rt; _Alloc = std::allocator<Only_int_rt>]’,
inlined from ‘std::vector<Only_int_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:136:41:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Only_int_rt*, std::vector<Only_int_rt> >’ 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<Only_int_rt*, vector<Only_int_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Only_int_rt*, vector<Only_int_rt> >; _Compare = pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::vector<Only_int_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:139:16:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Only_int_rt*, std::vector<Only_int_rt> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Only_int_rt*, vector<Only_int_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Only_int_rt*, vector<Only_int_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)> >]’ 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<Only_int_rt*, vector<Only_int_rt> >; _Compare = pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Only_int_rt&, const Only_int_rt&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::vector<Only_int_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:139:16:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Only_int_rt*, std::vector<Only_int_rt> >’ 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<Only_int_rt*, std::vector<Only_int_rt> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::flow::PgrCardinalityGraph::V pgrouting::flow::PgrCardinalityGraph::get_boost_vertex(int64_t)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:69:24,
inlined from ‘pgrouting::flow::PgrCardinalityGraph::PgrCardinalityGraph(Edge_bool_t*, size_t)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:94:34,
inlined from ‘void do_pgr_maximum_cardinality_matching(Edge_bool_t*, size_t, bool, Only_int_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp:68:72:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::flow::PgrCardinalityGraph::V pgrouting::flow::PgrCardinalityGraph::get_boost_vertex(int64_t)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:69:24,
inlined from ‘pgrouting::flow::PgrCardinalityGraph::PgrCardinalityGraph(Edge_bool_t*, size_t)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:95:34,
inlined from ‘void do_pgr_maximum_cardinality_matching(Edge_bool_t*, size_t, bool, Only_int_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp:68:72:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
[ 33%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths_driver.cpp.o -MF CMakeFiles/max_flow.dir/edge_disjoint_paths_driver.cpp.o.d -o CMakeFiles/max_flow.dir/edge_disjoint_paths_driver.cpp.o -c /<<PKGBUILDDIR>>/src/max_flow/edge_disjoint_paths_driver.cpp
In file included from /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:41,
from /<<PKGBUILDDIR>>/src/max_flow/edge_disjoint_paths_driver.cpp:36:
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp: In constructor ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >; EdgeCapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, long long int, const long long int&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, const boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_reverse_t>; PredecessorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>&, boost::vertex_predecessor_t>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DistanceMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, long long int, long long int&, boost::vertex_distance_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, unsigned int>]’:
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:92:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, const long long int&, unsigned int, const boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_capacity_t>’ changed in GCC 7.1
92 | bk_max_flow(Graph& g, EdgeCapacityMap cap, ResidualCapacityEdgeMap res,
| ^~~~~~~~~~~
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:92:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:92:9: note: parameter passing for argument of type ‘boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, long long int, long long int&, boost::vertex_distance_t>’ changed in GCC 7.1
In function ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long long int, const long long int&, unsigned int, const property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long long int, long long int&, unsigned int, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, unsigned int>, const detail::edge_desc_impl<directed_tag, unsigned int>&, unsigned int, const property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > >, edge_reverse_t>; PredecessorMap = vec_adj_list_vertex_property_map<adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >*, detail::edge_desc_impl<directed_tag, unsigned int>, detail::edge_desc_impl<directed_tag, unsigned int>&, vertex_predecessor_t>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >*, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >*, long long int, long long int&, vertex_distance_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, unsigned int>]’,
inlined from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property]’ at /usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1039:38,
inlined from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<listS, vecS, directedS, property<vertex_index_t, long long int, property<vertex_color_t, default_color_type, property<vertex_distance_t, long long int, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >, property<edge_capacity_t, long long int, property<edge_residual_capacity_t, long long int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int> > > > >]’ at /usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1063:38,
inlined from ‘std::vector<Path_rt> pgrouting::graph::PgrFlowGraph::edge_disjoint_paths()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:100:55,
inlined from ‘std::vector<Path_rt> {anonymous}::single_execution(std::vector<Edge_t>, int64_t, int64_t, bool)’ at /<<PKGBUILDDIR>>/src/max_flow/edge_disjoint_paths_driver.cpp:66:34,
inlined from ‘void do_pgr_edge_disjoint_paths(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/edge_disjoint_paths_driver.cpp:124:33:
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, long long int, long long int&, unsigned int, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/usr/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: note: parameter passing for argument of type ‘boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, long long int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, long long int, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >, boost::property<boost::edge_capacity_t, long long int, boost::property<boost::edge_residual_capacity_t, long long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int> > > > >*, long long int, long long int&, boost::vertex_distance_t>’ changed in GCC 7.1
[ 34%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow_driver.cpp.o -MF CMakeFiles/max_flow.dir/minCostMaxFlow_driver.cpp.o.d -o CMakeFiles/max_flow.dir/minCostMaxFlow_driver.cpp.o -c /<<PKGBUILDDIR>>/src/max_flow/minCostMaxFlow_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/src/max_flow/minCostMaxFlow_driver.cpp:35:
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(const_iterator, const key_type&) [with _Key = long long int; _Val = long long int; _KeyOfValue = std::_Identity<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/stl_tree.h:2210:5: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator’ changed in GCC 7.1
2210 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/max_flow/pgr_minCostMaxFlow.hpp:38,
from /<<PKGBUILDDIR>>/src/max_flow/minCostMaxFlow_driver.cpp:37:
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp: In function ‘void boost::successive_shortest_path_nonnegative_weights(const Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, Distance2) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > > >; Capacity = adj_list_edge_property_map<directed_tag, double, const double&, unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_capacity_t>; ResidualCapacity = adj_list_edge_property_map<directed_tag, double, double&, unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_residual_capacity_t>; Reversed = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, unsigned int>, const detail::edge_desc_impl<directed_tag, unsigned int>&, unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_reverse_t>; Pred = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, unsigned int>, detail::edge_desc_impl<directed_tag, unsigned int>, detail::edge_desc_impl<directed_tag, unsigned int>&>; Weight = adj_list_edge_property_map<directed_tag, double, const double&, unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_weight_t>; Distance = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<no_property, unsigned int>, double, double&>; Distance2 = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<no_property, unsigned int>, double, double&>; VertexIndex = vec_adj_list_vertex_id_map<no_property, unsigned int>]’:
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:77:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
77 | void successive_shortest_path_nonnegative_weights(const Graph& g,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:77:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>’ changed in GCC 7.1
In function ‘void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, unsigned int>, const edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>, double, double&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>]’,
inlined from ‘void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, unsigned int>, const edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63,
inlined from ‘void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, unsigned int>, const edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63,
inlined from ‘void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > > >; P = int; T = buffer_param_t; R = no_property]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74,
inlined from ‘void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > > >]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49,
inlined from ‘double pgrouting::graph::PgrCostFlowGraph::MinCostMaxFlow()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_minCostMaxFlow.hpp:61:61,
inlined from ‘void do_pgr_minCostMaxFlow(CostFlow_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Flow_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/minCostMaxFlow_driver.cpp:106:42:
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
151 | residual_capacity, weight, rev, index, pred, dist,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
152 | make_iterator_property_map(d_map.begin(), index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>’ changed in GCC 7.1
[ 34%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/pgr_maxflow.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/pgr_maxflow.cpp.o -MF CMakeFiles/max_flow.dir/pgr_maxflow.cpp.o.d -o CMakeFiles/max_flow.dir/pgr_maxflow.cpp.o -c /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:34,
from /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:27:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Flow_t&}; _Tp = Flow_t; _Alloc = std::allocator<Flow_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Flow_t>::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 = Flow_t; _Alloc = std::allocator<Flow_t>]’,
inlined from ‘std::vector<Flow_t> pgrouting::graph::PgrFlowGraph::get_flow_edges() const’ at /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:219:33:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Flow_t*, std::vector<Flow_t> >’ 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 long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::graph::PgrFlowGraph::flow_dfs(V, size_t, std::vector<std::vector<long long int> >&)’ at /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:234:33:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::graph::PgrFlowGraph::flow_dfs(V, size_t, std::vector<std::vector<long long int> >&)’ at /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:243:41:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 Path_rt&}; _Tp = Path_rt; _Alloc = std::allocator<Path_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Path_rt>::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 = {long long int}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {long long int}; _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<Path_rt> pgrouting::graph::PgrFlowGraph::get_edge_disjoint_paths(size_t)’ at /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:270:45:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Path_rt; _Alloc = std::allocator<Path_rt>]’,
inlined from ‘std::vector<Path_rt> pgrouting::graph::PgrFlowGraph::get_edge_disjoint_paths(size_t)’ at /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:292:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ 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 = Path_rt; _Alloc = std::allocator<Path_rt>]’,
inlined from ‘std::vector<Path_rt> pgrouting::graph::PgrFlowGraph::get_edge_disjoint_paths(size_t)’ at /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:300:32:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 35%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/pgr_flowgraph.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/pgr_flowgraph.cpp.o -MF CMakeFiles/max_flow.dir/pgr_flowgraph.cpp.o.d -o CMakeFiles/max_flow.dir/pgr_flowgraph.cpp.o -c /<<PKGBUILDDIR>>/src/max_flow/pgr_flowgraph.cpp
[ 35%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/pgr_minCostMaxFlow.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/max_flow/CMakeFiles/max_flow.dir/pgr_minCostMaxFlow.cpp.o -MF CMakeFiles/max_flow.dir/pgr_minCostMaxFlow.cpp.o.d -o CMakeFiles/max_flow.dir/pgr_minCostMaxFlow.cpp.o -c /<<PKGBUILDDIR>>/src/max_flow/pgr_minCostMaxFlow.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/max_flow/pgr_minCostMaxFlow.hpp:34,
from /<<PKGBUILDDIR>>/src/max_flow/pgr_minCostMaxFlow.cpp:27:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Flow_t&}; _Tp = Flow_t; _Alloc = std::allocator<Flow_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Flow_t>::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 = Flow_t; _Alloc = std::allocator<Flow_t>]’,
inlined from ‘std::vector<Flow_t> pgrouting::graph::PgrCostFlowGraph::GetFlowEdges() const’ at /<<PKGBUILDDIR>>/src/max_flow/pgr_minCostMaxFlow.cpp:161:32:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Flow_t*, std::vector<Flow_t> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 35%] Built target max_flow
make -f src/contraction/CMakeFiles/contraction.dir/build.make src/contraction/CMakeFiles/contraction.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/contraction /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/contraction /<<PKGBUILDDIR>>/build-16/src/contraction/CMakeFiles/contraction.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/contraction/CMakeFiles/contraction.dir/build.make src/contraction/CMakeFiles/contraction.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 36%] Building C object src/contraction/CMakeFiles/contraction.dir/contractGraph.c.o
cd /<<PKGBUILDDIR>>/build-16/src/contraction && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/contraction/CMakeFiles/contraction.dir/contractGraph.c.o -MF CMakeFiles/contraction.dir/contractGraph.c.o.d -o CMakeFiles/contraction.dir/contractGraph.c.o -c /<<PKGBUILDDIR>>/src/contraction/contractGraph.c
[ 36%] Building CXX object src/contraction/CMakeFiles/contraction.dir/contractGraph_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/contraction && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/contraction/CMakeFiles/contraction.dir/contractGraph_driver.cpp.o -MF CMakeFiles/contraction.dir/contractGraph_driver.cpp.o.d -o CMakeFiles/contraction.dir/contractGraph_driver.cpp.o -c /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:34,
from /<<PKGBUILDDIR>>/include/contraction/pgr_contractionGraph.hpp:42,
from /<<PKGBUILDDIR>>/include/contraction/ch_graphs.hpp:39,
from /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:38:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/string:51,
from /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:32:
/usr/include/c++/13/bits/stl_algobase.h: In function ‘_OI std::copy(_II, _II, _OI) [with _II = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _OI = _Deque_iterator<long long int, long long int&, long long int*>]’:
/usr/include/c++/13/bits/stl_algobase.h:624:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
624 | copy(_II __first, _II __last, _OI __result)
| ^~~~
/usr/include/c++/13/bits/stl_algobase.h:624:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/deque:65,
from /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:34:
/usr/include/c++/13/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>]’:
/usr/include/c++/13/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
163 | uninitialized_copy(_InputIterator __first, _InputIterator __last,
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:35:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::CH_vertex, pgrouting::CH_edge>; T_V = pgrouting::CH_vertex; T_E = pgrouting::CH_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::CH_vertex, pgrouting::CH_edge>; T_V = pgrouting::CH_vertex; T_E = pgrouting::CH_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In member function ‘std::__enable_if_t<std::is_same<_Val, typename std::iterator_traits<_InputIterator>::value_type>::value> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_range_unique(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<long long int>; _Key = long long int; _Val = long long int; _KeyOfValue = std::_Identity<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/stl_tree.h:1100:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
1100 | _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h:1100:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
In file included from /usr/include/c++/13/set:63:
In member function ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<long long int>; _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::Identifiers<T>& pgrouting::Identifiers<T>::operator+=(const pgrouting::Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:132:21,
inlined from ‘std::tuple<double, pgrouting::Identifiers<long long int>, bool> pgrouting::graph::Pgr_contractionGraph<G>::get_min_cost_edge(V, V) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::CH_vertex, pgrouting::CH_edge>]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_contractionGraph.hpp:101:42:
/usr/include/c++/13/bits/stl_set.h:569:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
569 | { _M_t._M_insert_range_unique(__first, __last); }
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In member function ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<long long int>; _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::Identifiers<T>& pgrouting::Identifiers<T>::operator+=(const pgrouting::Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:132:21,
inlined from ‘std::tuple<double, pgrouting::Identifiers<long long int>, bool> pgrouting::graph::Pgr_contractionGraph<G>::get_min_cost_edge(V, V) [with G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::CH_vertex, pgrouting::CH_edge>]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_contractionGraph.hpp:101:42:
/usr/include/c++/13/bits/stl_set.h:569:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
569 | { _M_t._M_insert_range_unique(__first, __last); }
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In member function ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<long long int>; _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::Identifiers<T>& pgrouting::Identifiers<T>::operator+=(const pgrouting::Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:132:21,
inlined from ‘pgrouting::Identifiers<long long int> pgrouting::operator+(const Identifiers<long long int>&, const Identifiers<long long int>&)’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:122:19,
inlined from ‘void pgrouting::contraction::Pgr_linear<G>::process_shortcut(G&, V, V, V) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_linearContraction.hpp:171:19:
/usr/include/c++/13/bits/stl_set.h:569:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
569 | { _M_t._M_insert_range_unique(__first, __last); }
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In member function ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<long long int>; _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::Identifiers<T>& pgrouting::Identifiers<T>::operator+=(const pgrouting::Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:132:21,
inlined from ‘void pgrouting::contraction::Pgr_linear<G>::process_shortcut(G&, V, V, V) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_linearContraction.hpp:174:34:
/usr/include/c++/13/bits/stl_set.h:569:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
569 | { _M_t._M_insert_range_unique(__first, __last); }
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In member function ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<long long int>; _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::Identifiers<T>& pgrouting::Identifiers<T>::operator+=(const pgrouting::Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:132:21,
inlined from ‘pgrouting::Identifiers<long long int> pgrouting::operator+(const Identifiers<long long int>&, const Identifiers<long long int>&)’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:122:19,
inlined from ‘void pgrouting::contraction::Pgr_linear<G>::process_shortcut(G&, V, V, V) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_linearContraction.hpp:171:19:
/usr/include/c++/13/bits/stl_set.h:569:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
569 | { _M_t._M_insert_range_unique(__first, __last); }
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In member function ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<long long int>; _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::Identifiers<T>& pgrouting::Identifiers<T>::operator+=(const pgrouting::Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:132:21,
inlined from ‘void pgrouting::contraction::Pgr_linear<G>::process_shortcut(G&, V, V, V) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_linearContraction.hpp:174:34:
/usr/include/c++/13/bits/stl_set.h:569:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
569 | { _M_t._M_insert_range_unique(__first, __last); }
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/deque:69:
/usr/include/c++/13/bits/deque.tcc: In member function ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
771 | deque<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/deque.tcc:794:21: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
794 | std::copy(__first, __last, __pos - difference_type(__n));
| ^~~
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Tp = long long int]’,
inlined from ‘_ForwardIterator std::__uninitialized_move_copy(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = _Deque_iterator<long long int, long long int&, long long int*>; _InputIterator2 = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Allocator = allocator<long long int>]’ at /usr/include/c++/13/bits/stl_uninitialized.h:528:72,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/deque.tcc:800:7:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
/usr/include/c++/13/bits/deque.tcc: In member function ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/deque.tcc:805:21: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
805 | std::copy(__mid, __last, __old_start);
| ^~~
/usr/include/c++/13/bits/deque.tcc:834:19: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
834 | std::copy(__first, __last, __pos);
| ^~~
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Tp = long long int]’,
inlined from ‘_ForwardIterator std::__uninitialized_copy_move(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _InputIterator2 = _Deque_iterator<long long int, long long int&, long long int*>; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Allocator = allocator<long long int>]’ at /usr/include/c++/13/bits/stl_uninitialized.h:495:24,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/deque.tcc:840:5:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
/usr/include/c++/13/bits/deque.tcc: In member function ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/deque.tcc:845:19: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
845 | std::copy(__first, __mid, __pos);
| ^~~
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Tp = long long int]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/deque.tcc:609:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; <template-parameter-2-2> = void; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘pgrouting::contraction::Pgr_contract<G>::Pgr_contract(G&, pgrouting::Identifiers<typename G::V>, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Tp = long long int]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/deque.tcc:625:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; <template-parameter-2-2> = void; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘pgrouting::contraction::Pgr_contract<G>::Pgr_contract(G&, pgrouting::Identifiers<typename G::V>, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Tp = long long int]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/deque.tcc:609:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; <template-parameter-2-2> = void; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘pgrouting::contraction::Pgr_contract<G>::Pgr_contract(G&, pgrouting::Identifiers<typename G::V>, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _ForwardIterator = _Deque_iterator<long long int, long long int&, long long int*>; _Tp = long long int]’,
inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_insert_aux(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/deque.tcc:625:3,
inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >; <template-parameter-2-2> = void; _Tp = long long int; _Alloc = std::allocator<long long int>]’ at /usr/include/c++/13/bits/stl_deque.h:1734:23,
inlined from ‘pgrouting::contraction::Pgr_contract<G>::Pgr_contract(G&, pgrouting::Identifiers<typename G::V>, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_contractionGraph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, pgrouting::CH_vertex, pgrouting::CH_edge> >]’ at /<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9:
/usr/include/c++/13/bits/stl_uninitialized.h:373:63: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
373 | return std::uninitialized_copy(__first, __last, __result);
| ^
[ 37%] Building CXX object src/contraction/CMakeFiles/contraction.dir/pgr_contract.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/contraction && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/contraction/CMakeFiles/contraction.dir/pgr_contract.cpp.o -MF CMakeFiles/contraction.dir/pgr_contract.cpp.o.d -o CMakeFiles/contraction.dir/pgr_contract.cpp.o -c /<<PKGBUILDDIR>>/src/contraction/pgr_contract.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 37%] Built target contraction
make -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/pickDeliver /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/pickDeliver /<<PKGBUILDDIR>>/build-16/src/pickDeliver/CMakeFiles/pickDeliver.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 37%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_orders.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_orders.cpp.o -MF CMakeFiles/pickDeliver.dir/pd_orders.cpp.o.d -o CMakeFiles/pickDeliver.dir/pd_orders.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/pd_orders.cpp
[ 38%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/fleet.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/fleet.cpp.o -MF CMakeFiles/pickDeliver.dir/fleet.cpp.o.d -o CMakeFiles/pickDeliver.dir/fleet.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/fleet.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/vrp/fleet.h:33,
from /<<PKGBUILDDIR>>/src/pickDeliver/fleet.cpp:26:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {Vehicle_t}; _Tp = Vehicle_t; _Alloc = std::allocator<Vehicle_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Vehicle_t>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:65:
/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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::pointer std::vector<_Tp, _Alloc>::_M_allocate_and_copy(size_type, _ForwardIterator, _ForwardIterator) [with _ForwardIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:1619:35,
inlined from ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/vector.tcc:238:44:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ 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 = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:47:7:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {pgrouting::vrp::Vehicle_pickDeliver}; _Tp = pgrouting::vrp::Vehicle_pickDeliver; _Alloc = std::allocator<pgrouting::vrp::Vehicle_pickDeliver>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::vrp::Vehicle_pickDeliver>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {pgrouting::vrp::Vehicle_pickDeliver}; _Tp = pgrouting::vrp::Vehicle_pickDeliver; _Alloc = std::allocator<pgrouting::vrp::Vehicle_pickDeliver>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::vrp::Vehicle_pickDeliver; _Alloc = std::allocator<pgrouting::vrp::Vehicle_pickDeliver>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void pgrouting::vrp::Fleet::add_vehicle(Vehicle_t, double, const pgrouting::vrp::Vehicle_node&, const pgrouting::vrp::Vehicle_node&)’ at /<<PKGBUILDDIR>>/src/pickDeliver/fleet.cpp:134:27:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Vehicle_pickDeliver*, std::vector<pgrouting::vrp::Vehicle_pickDeliver> >’ 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 = {Vehicle_t}; _Tp = Vehicle_t; _Alloc = std::allocator<Vehicle_t>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = Vehicle_t; _Alloc = std::allocator<Vehicle_t>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘bool pgrouting::vrp::Fleet::build_fleet(std::vector<Vehicle_t>, double)’ at /<<PKGBUILDDIR>>/src/pickDeliver/fleet.cpp:168:23:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Vehicle_t*, std::vector<Vehicle_t> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 38%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pgr_pickDeliver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/pgr_pickDeliver.cpp.o -MF CMakeFiles/pickDeliver.dir/pgr_pickDeliver.cpp.o.d -o CMakeFiles/pickDeliver.dir/pgr_pickDeliver.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/vrp/pgr_pickDeliver.h:34,
from /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:25:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Schedule_rt&}; _Tp = Schedule_rt; _Alloc = std::allocator<Schedule_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Schedule_rt>::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 = Schedule_rt; _Alloc = std::allocator<Schedule_rt>]’,
inlined from ‘std::vector<Schedule_rt> pgrouting::vrp::Pgr_pickDeliver::get_postgres_result() const’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:118:21:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Schedule_rt*, std::vector<Schedule_rt> >’ 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 pgrouting::vrp::Vehicle_node&}; _Tp = pgrouting::vrp::Vehicle_node; _Alloc = std::allocator<pgrouting::vrp::Vehicle_node>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::vrp::Vehicle_node>::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 = pgrouting::vrp::Vehicle_node; _Alloc = std::allocator<pgrouting::vrp::Vehicle_node>]’,
inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::add_node(const pgrouting::vrp::Vehicle_node&)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:131:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Vehicle_node*, std::vector<pgrouting::vrp::Vehicle_node> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:65:
/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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ 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 = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:47:7,
inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = pgrouting::vrp::Vehicle_pickDeliver; _Args = {const pgrouting::vrp::Vehicle_pickDeliver&}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
inlined from ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, const pgrouting::vrp::Vehicle_pickDeliver&, const pgrouting::vrp::Vehicle_pickDeliver*>; _ForwardIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>]’ at /usr/include/c++/13/bits/stl_uninitialized.h:120:21:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {pgrouting::vrp::Solution}; _Tp = pgrouting::vrp::Solution; _Alloc = std::allocator<pgrouting::vrp::Solution>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<pgrouting::vrp::Solution>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In static member function ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::pointer std::vector<_Tp, _Alloc>::_M_allocate_and_copy(size_type, _ForwardIterator, _ForwardIterator) [with _ForwardIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:1619:35,
inlined from ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/vector.tcc:238:44,
inlined from ‘pgrouting::vrp::PD_Orders& pgrouting::vrp::PD_Orders::operator=(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘pgrouting::vrp::Vehicle_pickDeliver& pgrouting::vrp::Vehicle_pickDeliver::operator=(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:47:7,
inlined from ‘static _OI std::__copy_move<false, false, std::random_access_iterator_tag>::__copy_m(_II, _II, _OI) [with _II = pgrouting::vrp::Vehicle_pickDeliver*; _OI = pgrouting::vrp::Vehicle_pickDeliver*]’ at /usr/include/c++/13/bits/stl_algobase.h:388:18,
inlined from ‘_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = pgrouting::vrp::Vehicle_pickDeliver*; _OI = pgrouting::vrp::Vehicle_pickDeliver*]’ at /usr/include/c++/13/bits/stl_algobase.h:506:30,
inlined from ‘_OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = false; _II = pgrouting::vrp::Vehicle_pickDeliver*; _OI = pgrouting::vrp::Vehicle_pickDeliver*]’ at /usr/include/c++/13/bits/stl_algobase.h:533:42,
inlined from ‘typename __gnu_cxx::__enable_if<std::__is_random_access_iter<_II>::__value, std::_Deque_iterator<_Tp, _Tp&, _Tp*> >::__type std::__copy_move_a1(_II, _II, _Deque_iterator<_Tp, _Tp&, _Tp*>) [with bool _IsMove = false; _II = pgrouting::vrp::Vehicle_pickDeliver*; _Tp = pgrouting::vrp::Vehicle_pickDeliver]’ at /usr/include/c++/13/bits/deque.tcc:1060:32:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:38,
from /<<PKGBUILDDIR>>/include/vrp/fleet.h:37,
from /<<PKGBUILDDIR>>/include/vrp/pgr_pickDeliver.h:42:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ changed in GCC 7.1
1792 | __unguarded_linear_insert(_RandomAccessIterator __last,
| ^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/bits/stl_algo.h:61:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Distance = int; _Tp = pgrouting::vrp::Solution; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {pgrouting::vrp::Solution}; _Tp = pgrouting::vrp::Solution; _Alloc = std::allocator<pgrouting::vrp::Solution>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::vrp::Solution; _Alloc = std::allocator<pgrouting::vrp::Solution>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:59:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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 = {pgrouting::vrp::Solution}; _Tp = pgrouting::vrp::Solution; _Alloc = std::allocator<pgrouting::vrp::Solution>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::vrp::Solution; _Alloc = std::allocator<pgrouting::vrp::Solution>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:67:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Compare = pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:78:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)> >]’ 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<pgrouting::vrp::Solution*, vector<pgrouting::vrp::Solution> >; _Compare = pgrouting::vrp::Pgr_pickDeliver::solve()::<lambda(const pgrouting::vrp::Solution&, const pgrouting::vrp::Solution&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:78:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ 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 = {pgrouting::vrp::Solution}; _Tp = pgrouting::vrp::Solution; _Alloc = std::allocator<pgrouting::vrp::Solution>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = pgrouting::vrp::Solution; _Alloc = std::allocator<pgrouting::vrp::Solution>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:84:24:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::vrp::Solution*, std::vector<pgrouting::vrp::Solution> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 39%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/dnode.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/dnode.cpp.o -MF CMakeFiles/pickDeliver.dir/dnode.cpp.o.d -o CMakeFiles/pickDeliver.dir/dnode.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/dnode.cpp
[ 39%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_pickDeliver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_pickDeliver.cpp.o -MF CMakeFiles/pickDeliver.dir/vehicle_pickDeliver.cpp.o.d -o CMakeFiles/pickDeliver.dir/vehicle_pickDeliver.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/vehicle_pickDeliver.cpp
In file included from /usr/include/c++/13/vector:65,
from /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:32,
from /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:34,
from /<<PKGBUILDDIR>>/src/pickDeliver/vehicle_pickDeliver.cpp:26:
/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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ 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 = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:47:7,
inlined from ‘bool pgrouting::vrp::Vehicle_pickDeliver::is_order_feasable(const pgrouting::vrp::Order&) const’ at /<<PKGBUILDDIR>>/src/pickDeliver/vehicle_pickDeliver.cpp:332:25:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::pointer std::vector<_Tp, _Alloc>::_M_allocate_and_copy(size_type, _ForwardIterator, _ForwardIterator) [with _ForwardIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:1619:35,
inlined from ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/vector.tcc:238:44,
inlined from ‘pgrouting::vrp::PD_Orders& pgrouting::vrp::PD_Orders::operator=(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘void pgrouting::vrp::Vehicle_pickDeliver::set_compatibles(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/src/pickDeliver/vehicle_pickDeliver.cpp:323:16:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 40%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/solution.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/solution.cpp.o -MF CMakeFiles/pickDeliver.dir/solution.cpp.o.d -o CMakeFiles/pickDeliver.dir/solution.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/solution.cpp
[ 40%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/optimize.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/optimize.cpp.o -MF CMakeFiles/pickDeliver.dir/optimize.cpp.o.d -o CMakeFiles/pickDeliver.dir/optimize.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/optimize.cpp
In file included from /usr/include/c++/13/deque:65,
from /<<PKGBUILDDIR>>/include/vrp/solution.h:32,
from /<<PKGBUILDDIR>>/src/pickDeliver/optimize.cpp:33:
/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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ 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 = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:47:7:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ 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 = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:47:7,
inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = pgrouting::vrp::Vehicle_pickDeliver; _Args = {const pgrouting::vrp::Vehicle_pickDeliver&}]’ at /usr/include/c++/13/bits/stl_construct.h:119:7,
inlined from ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, const pgrouting::vrp::Vehicle_pickDeliver&, const pgrouting::vrp::Vehicle_pickDeliver*>; _ForwardIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>]’ 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 = std::_Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, const pgrouting::vrp::Vehicle_pickDeliver&, const pgrouting::vrp::Vehicle_pickDeliver*>; _ForwardIterator = std::_Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>; bool _TrivialValueTypes = false]’ at /usr/include/c++/13/bits/stl_uninitialized.h:137:58,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, const pgrouting::vrp::Vehicle_pickDeliver&, const pgrouting::vrp::Vehicle_pickDeliver*>; _ForwardIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:41,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, const pgrouting::vrp::Vehicle_pickDeliver&, const pgrouting::vrp::Vehicle_pickDeliver*>; _ForwardIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>; _Tp = pgrouting::vrp::Vehicle_pickDeliver]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:63:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ 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 pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*]’ 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 pgrouting::vrp::Order*, vector<pgrouting::vrp::Order> >; _ForwardIterator = pgrouting::vrp::Order*; _Tp = pgrouting::vrp::Order]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::pointer std::vector<_Tp, _Alloc>::_M_allocate_and_copy(size_type, _ForwardIterator, _ForwardIterator) [with _ForwardIterator = __gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >; _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/stl_vector.h:1619:35,
inlined from ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = pgrouting::vrp::Order; _Alloc = std::allocator<pgrouting::vrp::Order>]’ at /usr/include/c++/13/bits/vector.tcc:238:44,
inlined from ‘pgrouting::vrp::PD_Orders& pgrouting::vrp::PD_Orders::operator=(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:48:7,
inlined from ‘pgrouting::vrp::Vehicle_pickDeliver& pgrouting::vrp::Vehicle_pickDeliver::operator=(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:47:7:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::vrp::Order*, std::vector<pgrouting::vrp::Order> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 41%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/tw_node.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/tw_node.cpp.o -MF CMakeFiles/pickDeliver.dir/tw_node.cpp.o.d -o CMakeFiles/pickDeliver.dir/tw_node.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/tw_node.cpp
[ 41%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_node.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_node.cpp.o -MF CMakeFiles/pickDeliver.dir/vehicle_node.cpp.o.d -o CMakeFiles/pickDeliver.dir/vehicle_node.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/vehicle_node.cpp
[ 42%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/order.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/order.cpp.o -MF CMakeFiles/pickDeliver.dir/order.cpp.o.d -o CMakeFiles/pickDeliver.dir/order.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/order.cpp
[ 42%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/initial_solution.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/initial_solution.cpp.o -MF CMakeFiles/pickDeliver.dir/initial_solution.cpp.o.d -o CMakeFiles/pickDeliver.dir/initial_solution.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/initial_solution.cpp
[ 43%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle.cpp.o -MF CMakeFiles/pickDeliver.dir/vehicle.cpp.o.d -o CMakeFiles/pickDeliver.dir/vehicle.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/vehicle.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/vrp/vehicle.h:38,
from /<<PKGBUILDDIR>>/src/pickDeliver/vehicle.cpp:26:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Schedule_rt&}; _Tp = Schedule_rt; _Alloc = std::allocator<Schedule_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Schedule_rt>::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 = Schedule_rt; _Alloc = std::allocator<Schedule_rt>]’,
inlined from ‘std::vector<Schedule_rt> pgrouting::vrp::Vehicle::get_postgres_result(int) const’ at /<<PKGBUILDDIR>>/src/pickDeliver/vehicle.cpp:169:25:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Schedule_rt*, std::vector<Schedule_rt> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 43%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean_driver.cpp.o -MF CMakeFiles/pickDeliver.dir/pickDeliverEuclidean_driver.cpp.o.d -o CMakeFiles/pickDeliver.dir/pickDeliverEuclidean_driver.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:37:
/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<std::pair<double, double>&&>, std::tuple<>}; _Key = std::pair<double, double>; _Val = std::pair<const std::pair<double, double>, long long int>; _KeyOfValue = std::_Select1st<std::pair<const std::pair<double, double>, long long int> >; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::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:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:94:70:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:95:76:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:99:72:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:100:68:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:116:87:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:117:96:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:120:90:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<double, double>; _Tp = long long int; _Compare = std::less<std::pair<double, double> >; _Alloc = std::allocator<std::pair<const std::pair<double, double>, long long int> >]’,
inlined from ‘void do_pgr_pickDeliverEuclidean(Orders_t*, size_t, Vehicle_t*, size_t, double, int, int, Schedule_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:121:84:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<double, double>, std::pair<const std::pair<double, double>, long long int>, std::_Select1st<std::pair<const std::pair<double, double>, long long int> >, std::less<std::pair<double, double> >, std::allocator<std::pair<const std::pair<double, double>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 44%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver_driver.cpp.o -MF CMakeFiles/pickDeliver.dir/pickDeliver_driver.cpp.o.d -o CMakeFiles/pickDeliver.dir/pickDeliver_driver.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliver_driver.cpp
[ 44%] Building C object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean.c.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean.c.o -MF CMakeFiles/pickDeliver.dir/pickDeliverEuclidean.c.o.d -o CMakeFiles/pickDeliver.dir/pickDeliverEuclidean.c.o -c /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean.c
[ 45%] Building C object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver.c.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver.c.o -MF CMakeFiles/pickDeliver.dir/pickDeliver.c.o.d -o CMakeFiles/pickDeliver.dir/pickDeliver.c.o -c /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliver.c
[ 45%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_problem.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_problem.cpp.o -MF CMakeFiles/pickDeliver.dir/pd_problem.cpp.o.d -o CMakeFiles/pickDeliver.dir/pd_problem.cpp.o -c /<<PKGBUILDDIR>>/src/pickDeliver/pd_problem.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 45%] Built target pickDeliver
make -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/withPoints /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/withPoints /<<PKGBUILDDIR>>/build-16/src/withPoints/CMakeFiles/withPoints.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 46%] Building C object src/withPoints/CMakeFiles/withPoints.dir/withPoints.c.o
cd /<<PKGBUILDDIR>>/build-16/src/withPoints && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/withPoints/CMakeFiles/withPoints.dir/withPoints.c.o -MF CMakeFiles/withPoints.dir/withPoints.c.o.d -o CMakeFiles/withPoints.dir/withPoints.c.o -c /<<PKGBUILDDIR>>/src/withPoints/withPoints.c
[ 46%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/get_new_queries.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/withPoints/CMakeFiles/withPoints.dir/get_new_queries.cpp.o -MF CMakeFiles/withPoints.dir/get_new_queries.cpp.o.d -o CMakeFiles/withPoints.dir/get_new_queries.cpp.o -c /<<PKGBUILDDIR>>/src/withPoints/get_new_queries.cpp
[ 47%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/withPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/withPoints/CMakeFiles/withPoints.dir/withPoints_driver.cpp.o -MF CMakeFiles/withPoints.dir/withPoints_driver.cpp.o.d -o CMakeFiles/withPoints.dir/withPoints_driver.cpp.o -c /<<PKGBUILDDIR>>/src/withPoints/withPoints_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:40,
from /<<PKGBUILDDIR>>/src/withPoints/withPoints_driver.cpp:40:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:46:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_pgr_withPoints(Edge_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, char, bool, bool, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/withPoints/withPoints_driver.cpp:151:61:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_pgr_withPoints(Edge_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, char, bool, bool, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/withPoints/withPoints_driver.cpp:161:65:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
[ 47%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/pgr_withPoints.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/withPoints/CMakeFiles/withPoints.dir/pgr_withPoints.cpp.o -MF CMakeFiles/withPoints.dir/pgr_withPoints.cpp.o.d -o CMakeFiles/withPoints.dir/pgr_withPoints.cpp.o -c /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp
In file included from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/include/cpp_common/basePath_SSEC.hpp:38,
from /<<PKGBUILDDIR>>/include/withPoints/pgr_withPoints.hpp:36,
from /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:31:
/usr/include/c++/13/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Point_on_edge_t*, vector<Point_on_edge_t> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1792:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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<Point_on_edge_t*, vector<Point_on_edge_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/bits/stl_algo.h:61:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Point_on_edge_t*, vector<Point_on_edge_t> >; _Distance = int; _Tp = Point_on_edge_t; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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<Point_on_edge_t*, vector<Point_on_edge_t> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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<Point_on_edge_t*, vector<Point_on_edge_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Point_on_edge_t*, vector<Point_on_edge_t> >; _Compare = pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void pgrouting::Pg_points_graph::check_points()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:117:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Point_on_edge_t*, vector<Point_on_edge_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Point_on_edge_t*, vector<Point_on_edge_t> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)> >]’ 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<Point_on_edge_t*, vector<Point_on_edge_t> >; _Compare = pgrouting::Pg_points_graph::check_points()::<lambda(const Point_on_edge_t&, const Point_on_edge_t&)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘void pgrouting::Pg_points_graph::check_points()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:117:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/withPoints/pgr_withPoints.hpp:32:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Point_on_edge_t&}; _Tp = Point_on_edge_t; _Alloc = std::allocator<Point_on_edge_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Point_on_edge_t>::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 Edge_t&}; _Tp = Edge_t; _Alloc = std::allocator<Edge_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Edge_t>::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 = Point_on_edge_t; _Alloc = std::allocator<Point_on_edge_t>]’,
inlined from ‘void pgrouting::Pg_points_graph::create_new_edges()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:405:33:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Point_on_edge_t*, std::vector<Point_on_edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘void pgrouting::Pg_points_graph::create_new_edges()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:428:46:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘void pgrouting::Pg_points_graph::create_new_edges()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:445:46:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘void pgrouting::Pg_points_graph::create_new_edges()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:475:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘void pgrouting::Pg_points_graph::create_new_edges()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:499:38:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘void pgrouting::Pg_points_graph::create_new_edges()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:519:34:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘void pgrouting::Pg_points_graph::create_new_edges()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:529:34:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 48%] Building C object src/withPoints/CMakeFiles/withPoints.dir/withPointsVia.c.o
cd /<<PKGBUILDDIR>>/build-16/src/withPoints && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/withPoints/CMakeFiles/withPoints.dir/withPointsVia.c.o -MF CMakeFiles/withPoints.dir/withPointsVia.c.o.d -o CMakeFiles/withPoints.dir/withPointsVia.c.o -c /<<PKGBUILDDIR>>/src/withPoints/withPointsVia.c
[ 49%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/withPointsVia_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/withPoints/CMakeFiles/withPoints.dir/withPointsVia_driver.cpp.o -MF CMakeFiles/withPoints.dir/withPointsVia_driver.cpp.o.d -o CMakeFiles/withPoints.dir/withPointsVia_driver.cpp.o -c /<<PKGBUILDDIR>>/src/withPoints/withPointsVia_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:40,
from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:37,
from /<<PKGBUILDDIR>>/src/withPoints/withPointsVia_driver.cpp:34:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::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,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:46:
/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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_withPointsVia(Edge_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t*, size_t, bool, char, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/withPoints/withPointsVia_driver.cpp:164:61:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::Pgr_base_graph(const std::vector<T_V>&, graphType) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:315:30,
inlined from ‘void do_withPointsVia(Edge_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t*, size_t, bool, char, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/withPoints/withPointsVia_driver.cpp:175:65:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 49%] Built target withPoints
make -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/lineGraph /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/lineGraph /<<PKGBUILDDIR>>/build-16/src/lineGraph/CMakeFiles/lineGraph.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 50%] Building C object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull.c.o
cd /<<PKGBUILDDIR>>/build-16/src/lineGraph && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull.c.o -MF CMakeFiles/lineGraph.dir/lineGraphFull.c.o.d -o CMakeFiles/lineGraph.dir/lineGraphFull.c.o -c /<<PKGBUILDDIR>>/src/lineGraph/lineGraphFull.c
[ 50%] Building CXX object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/lineGraph && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull_driver.cpp.o -MF CMakeFiles/lineGraph.dir/lineGraphFull_driver.cpp.o.d -o CMakeFiles/lineGraph.dir/lineGraphFull_driver.cpp.o -c /<<PKGBUILDDIR>>/src/lineGraph/lineGraphFull_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:40,
from /<<PKGBUILDDIR>>/src/lineGraph/lineGraphFull_driver.cpp:36:
/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<long long int&&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, long long int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, long long int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, double>; _KeyOfValue = std::_Select1st<std::pair<const long long int, double> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, double> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, double>, std::_Select1st<std::pair<const long long int, double> >, std::less<long long int>, std::allocator<std::pair<const long long int, double> > >::const_iterator’ changed in GCC 7.1
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::pair<long long int, long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::pair<long long int, long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::pair<long long int, long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::pair<long long int, long long int> >, std::_Select1st<std::pair<const long long int, std::pair<long long int, long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::pair<long long int, long long int> > > >::const_iterator’ changed in GCC 7.1
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, long long int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, long long int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/lineGraph/lineGraphFull_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Line_graph_full_rt&}; _Tp = Line_graph_full_rt; _Alloc = std::allocator<Line_graph_full_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Line_graph_full_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:46:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::pair<long long int, long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::pair<long long int, long long int> > >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:108:68:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::pair<long long int, long long int> >, std::_Select1st<std::pair<const long long int, std::pair<long long int, long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::pair<long long int, long long 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 = long long int; _Tp = std::pair<long long int, long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::pair<long long int, long long int> > >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:111:68:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::pair<long long int, long long int> >, std::_Select1st<std::pair<const long long int, std::pair<long long int, long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::pair<long long int, long long 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 = long long int; _Tp = double; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, double> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:118:42:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, double>, std::_Select1st<std::pair<const long long int, double> >, std::less<long long int>, std::allocator<std::pair<const long long int, double> > >::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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:125:38:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:126:46:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:129:38:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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[](key_type&&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:130:61:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:137:38:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:138:46:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:141:38:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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[](key_type&&) [with _Key = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:142:61:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:153:34:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 = long long int; _Tp = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:154:34:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, long long int>, std::_Select1st<std::pair<const long long int, long long int> >, std::less<long long int>, std::allocator<std::pair<const long long int, long long 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 file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Line_graph_full_rt; _Alloc = std::allocator<Line_graph_full_rt>]’,
inlined from ‘std::vector<Line_graph_full_rt> pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:163:34:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Line_graph_full_rt*, std::vector<Line_graph_full_rt> >’ 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
/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<std::pair<long long int, long long int>&&>, std::tuple<>}; _Key = std::pair<long long int, long long int>; _Val = std::pair<const std::pair<long long int, long long int>, long long int>; _KeyOfValue = std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::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 = long long int; _Tp = std::pair<long long int, long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::pair<long long int, long long int> > >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::insert_vertex(int64_t, int64_t) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:173:38,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:245:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::pair<long long int, long long int> >, std::_Select1st<std::pair<const long long int, std::pair<long long int, long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::pair<long long int, long long 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[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::insert_vertex(int64_t, int64_t) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:176:69,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:245:30:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::insert_vertex(int64_t, int64_t) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:181:27,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:245:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = std::pair<long long int, long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::pair<long long int, long long int> > >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::insert_vertex(int64_t, int64_t) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:173:38,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:252:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::pair<long long int, long long int> >, std::_Select1st<std::pair<const long long int, std::pair<long long int, long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::pair<long long int, long long 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[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::insert_vertex(int64_t, int64_t) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:176:69,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:252:30:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::insert_vertex(int64_t, int64_t) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:181:27,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:252:30:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::graph_add_edge(int64_t, const T&, const T&, int64_t, int64_t) [with T = long long int; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:208:18,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:261:35:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::graph_add_edge(int64_t, const T&, const T&, int64_t, int64_t) [with T = long long int; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:211:18,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:261:35:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::graph_add_edge(int64_t, const T&, const T&, int64_t, int64_t) [with T = long long int; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:208:18,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:287:31:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::graph_add_edge(int64_t, const T&, const T&, int64_t, int64_t) [with T = long long int; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:211:18,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::apply_transformation(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:287:31:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | 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 = long long int; _Tp = double; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, double> >]’,
inlined from ‘void pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::store_edge_costs(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:189:25,
inlined from ‘pgrouting::graph::Pgr_lineGraphFull<G, T_V, T_E>::Pgr_lineGraphFull(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraphFull.hpp:65:29,
inlined from ‘void do_pgr_lineGraphFull(Edge_t*, size_t, Line_graph_full_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/lineGraph/lineGraphFull_driver.cpp:101:49:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, double>, std::_Select1st<std::pair<const long long int, double> >, std::less<long long int>, std::allocator<std::pair<const long long int, double> > >::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<>());
| ~~~~~~~~~~~~~~~
[ 51%] Building C object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph.c.o
cd /<<PKGBUILDDIR>>/build-16/src/lineGraph && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph.c.o -MF CMakeFiles/lineGraph.dir/lineGraph.c.o.d -o CMakeFiles/lineGraph.dir/lineGraph.c.o -c /<<PKGBUILDDIR>>/src/lineGraph/lineGraph.c
[ 51%] Building CXX object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/lineGraph && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph_driver.cpp.o -MF CMakeFiles/lineGraph.dir/lineGraph_driver.cpp.o.d -o CMakeFiles/lineGraph.dir/lineGraph_driver.cpp.o -c /<<PKGBUILDDIR>>/src/lineGraph/lineGraph_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:40,
from /<<PKGBUILDDIR>>/src/lineGraph/lineGraph_driver.cpp:37:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/lineGraph/lineGraph_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Edge_t&}; _Tp = Edge_t; _Alloc = std::allocator<Edge_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Edge_t>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/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<std::pair<long long int, long long int>&&>, std::tuple<>}; _Key = std::pair<long long int, long long int>; _Val = std::pair<const std::pair<long long int, long long int>, Edge_t>; _KeyOfValue = std::_Select1st<std::pair<const std::pair<long long int, long long int>, Edge_t> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, Edge_t>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, Edge_t> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> > >::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,
from /<<PKGBUILDDIR>>/include/dijkstra/dijkstra.hpp:46:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = Edge_t; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> >]’,
inlined from ‘std::vector<Edge_t> pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraph.hpp:106:40:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, Edge_t>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, Edge_t> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = Edge_t; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> >]’,
inlined from ‘std::vector<Edge_t> pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraph.hpp:113:40:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, Edge_t>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, Edge_t> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = Edge_t; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> >]’,
inlined from ‘std::vector<Edge_t> pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraph.hpp:126:73:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, Edge_t>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, Edge_t> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, Edge_t> > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘std::vector<Edge_t> pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::get_postgres_results_directed() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraph.hpp:129:34:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::V pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::add_one_vertex(T_V) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraph.hpp:205:27,
inlined from ‘void pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::insert_vertices(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraph.hpp:145:27,
inlined from ‘pgrouting::graph::Pgr_lineGraph<G, T_V, T_E>::Pgr_lineGraph(const pgrouting::DirectedGraph&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Line_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Line_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/lineGraph/pgr_lineGraph.hpp:64:28,
inlined from ‘void do_pgr_lineGraph(Edge_t*, size_t, bool, Edge_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/lineGraph/lineGraph_driver.cpp:95:48:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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<>());
| ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 51%] Built target lineGraph
make -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/components /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/components /<<PKGBUILDDIR>>/build-16/src/components/CMakeFiles/components.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 52%] Building C object src/components/CMakeFiles/components.dir/connectedComponents.c.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/connectedComponents.c.o -MF CMakeFiles/components.dir/connectedComponents.c.o.d -o CMakeFiles/components.dir/connectedComponents.c.o -c /<<PKGBUILDDIR>>/src/components/connectedComponents.c
[ 52%] Building C object src/components/CMakeFiles/components.dir/strongComponents.c.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/strongComponents.c.o -MF CMakeFiles/components.dir/strongComponents.c.o.d -o CMakeFiles/components.dir/strongComponents.c.o -c /<<PKGBUILDDIR>>/src/components/strongComponents.c
[ 53%] Building C object src/components/CMakeFiles/components.dir/biconnectedComponents.c.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/biconnectedComponents.c.o -MF CMakeFiles/components.dir/biconnectedComponents.c.o.d -o CMakeFiles/components.dir/biconnectedComponents.c.o -c /<<PKGBUILDDIR>>/src/components/biconnectedComponents.c
[ 53%] Building C object src/components/CMakeFiles/components.dir/articulationPoints.c.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/articulationPoints.c.o -MF CMakeFiles/components.dir/articulationPoints.c.o.d -o CMakeFiles/components.dir/articulationPoints.c.o -c /<<PKGBUILDDIR>>/src/components/articulationPoints.c
[ 54%] Building C object src/components/CMakeFiles/components.dir/bridges.c.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/bridges.c.o -MF CMakeFiles/components.dir/bridges.c.o.d -o CMakeFiles/components.dir/bridges.c.o -c /<<PKGBUILDDIR>>/src/components/bridges.c
[ 54%] Building C object src/components/CMakeFiles/components.dir/makeConnected.c.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/makeConnected.c.o -MF CMakeFiles/components.dir/makeConnected.c.o.d -o CMakeFiles/components.dir/makeConnected.c.o -c /<<PKGBUILDDIR>>/src/components/makeConnected.c
[ 55%] Building CXX object src/components/CMakeFiles/components.dir/makeConnected_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/makeConnected_driver.cpp.o -MF CMakeFiles/components.dir/makeConnected_driver.cpp.o.d -o CMakeFiles/components.dir/makeConnected_driver.cpp.o -c /<<PKGBUILDDIR>>/src/components/makeConnected_driver.cpp
[ 55%] Building CXX object src/components/CMakeFiles/components.dir/componentsResult.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/componentsResult.cpp.o -MF CMakeFiles/components.dir/componentsResult.cpp.o.d -o CMakeFiles/components.dir/componentsResult.cpp.o -c /<<PKGBUILDDIR>>/src/components/componentsResult.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/components/componentsResult.cpp:30:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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>>/include/components/componentsResult.h:31,
from /<<PKGBUILDDIR>>/src/components/componentsResult.cpp:27:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<II_t_rt> pgrouting::algorithms::detail::componentsResult(std::vector<std::vector<long long int> >&)’ at /<<PKGBUILDDIR>>/src/components/componentsResult.cpp:42:18:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<II_t_rt> pgrouting::algorithms::detail::componentsResult(std::vector<std::vector<long long int> >&)’ at /<<PKGBUILDDIR>>/src/components/componentsResult.cpp:42:18:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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 = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<II_t_rt> pgrouting::algorithms::detail::componentsResult(std::vector<std::vector<long long int> >&)’ at /<<PKGBUILDDIR>>/src/components/componentsResult.cpp:51:30:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 56%] Building CXX object src/components/CMakeFiles/components.dir/pgr_components.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/pgr_components.cpp.o -MF CMakeFiles/components.dir/pgr_components.cpp.o.d -o CMakeFiles/components.dir/pgr_components.cpp.o -c /<<PKGBUILDDIR>>/src/components/pgr_components.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/components/pgr_components.hpp:31,
from /<<PKGBUILDDIR>>/src/components/pgr_components.cpp:27:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::vector<II_t_rt> pgrouting::algorithms::pgr_connectedComponents(pgrouting::UndirectedGraph&)’ at /<<PKGBUILDDIR>>/src/components/pgr_components.cpp:63:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::vector<II_t_rt> pgrouting::algorithms::biconnectedComponents(pgrouting::UndirectedGraph&)’ at /<<PKGBUILDDIR>>/src/components/pgr_components.cpp:119:37:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::vector<II_t_rt> pgrouting::algorithms::strongComponents(pgrouting::DirectedGraph&)’ at /<<PKGBUILDDIR>>/src/components/pgr_components.cpp:91:42:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 56%] Building CXX object src/components/CMakeFiles/components.dir/connectedComponents_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/connectedComponents_driver.cpp.o -MF CMakeFiles/components.dir/connectedComponents_driver.cpp.o.d -o CMakeFiles/components.dir/connectedComponents_driver.cpp.o -c /<<PKGBUILDDIR>>/src/components/connectedComponents_driver.cpp
[ 57%] Building CXX object src/components/CMakeFiles/components.dir/strongComponents_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/strongComponents_driver.cpp.o -MF CMakeFiles/components.dir/strongComponents_driver.cpp.o.d -o CMakeFiles/components.dir/strongComponents_driver.cpp.o -c /<<PKGBUILDDIR>>/src/components/strongComponents_driver.cpp
[ 57%] Building CXX object src/components/CMakeFiles/components.dir/biconnectedComponents_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/biconnectedComponents_driver.cpp.o -MF CMakeFiles/components.dir/biconnectedComponents_driver.cpp.o.d -o CMakeFiles/components.dir/biconnectedComponents_driver.cpp.o -c /<<PKGBUILDDIR>>/src/components/biconnectedComponents_driver.cpp
[ 58%] Building CXX object src/components/CMakeFiles/components.dir/articulationPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/articulationPoints_driver.cpp.o -MF CMakeFiles/components.dir/articulationPoints_driver.cpp.o.d -o CMakeFiles/components.dir/articulationPoints_driver.cpp.o -c /<<PKGBUILDDIR>>/src/components/articulationPoints_driver.cpp
[ 58%] Building CXX object src/components/CMakeFiles/components.dir/bridges_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/components/CMakeFiles/components.dir/bridges_driver.cpp.o -MF CMakeFiles/components.dir/bridges_driver.cpp.o.d -o CMakeFiles/components.dir/bridges_driver.cpp.o -c /<<PKGBUILDDIR>>/src/components/bridges_driver.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 58%] Built target components
make -f src/bellman_ford/CMakeFiles/bellman_ford.dir/build.make src/bellman_ford/CMakeFiles/bellman_ford.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bellman_ford /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/bellman_ford /<<PKGBUILDDIR>>/build-16/src/bellman_ford/CMakeFiles/bellman_ford.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/bellman_ford/CMakeFiles/bellman_ford.dir/build.make src/bellman_ford/CMakeFiles/bellman_ford.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 59%] Building C object src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford.c.o
cd /<<PKGBUILDDIR>>/build-16/src/bellman_ford && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford.c.o -MF CMakeFiles/bellman_ford.dir/bellman_ford.c.o.d -o CMakeFiles/bellman_ford.dir/bellman_ford.c.o -c /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford.c
[ 59%] Building CXX object src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/bellman_ford && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford_driver.cpp.o -MF CMakeFiles/bellman_ford.dir/bellman_ford_driver.cpp.o.d -o CMakeFiles/bellman_ford.dir/bellman_ford_driver.cpp.o -c /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:35:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_ForwardIterator std::__unique(_ForwardIterator, _ForwardIterator, _BinaryPredicate) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _BinaryPredicate = __gnu_cxx::__ops::_Iter_equal_to_iter]’:
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
905 | __unique(_ForwardIterator __first, _ForwardIterator __last,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ 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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/bellman_ford/pgr_bellman_ford.hpp:32,
from /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:38:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long int> > > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::_M_erase(iterator, iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
195 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::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 long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_bellman_ford<G>::bellman_ford(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_bellman_ford.hpp:201:38:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/bellman_ford/pgr_bellman_ford.hpp:39:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_bellman_ford<G>::bellman_ford(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_bellman_ford.hpp:204:45:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_bellman_ford<G>::bellman_ford(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_bellman_ford.hpp:201:38:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_bellman_ford<G>::bellman_ford(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_bellman_ford.hpp:204:45:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:139:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:139:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:64:14,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:140:37:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:66:24,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:140:37:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:65:18,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:140:37:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:69:14,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:140:37:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:71:24,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:140:37:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:70:18,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:140:37:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:149:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:149:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:64:14,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:150:37:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:66:24,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:150:37:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:65:18,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:150:37:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:69:14,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:150:37:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:71:24,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:150:37:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_bellman_ford(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, std::string&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:70:18,
inlined from ‘void do_pgr_bellman_ford(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:150:37:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 60%] Building C object src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore.c.o
cd /<<PKGBUILDDIR>>/build-16/src/bellman_ford && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore.c.o -MF CMakeFiles/bellman_ford.dir/edwardMoore.c.o.d -o CMakeFiles/bellman_ford.dir/edwardMoore.c.o -c /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore.c
[ 60%] Building CXX object src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/bellman_ford && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore_driver.cpp.o -MF CMakeFiles/bellman_ford.dir/edwardMoore_driver.cpp.o.d -o CMakeFiles/bellman_ford.dir/edwardMoore_driver.cpp.o -c /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:36:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_ForwardIterator std::__unique(_ForwardIterator, _ForwardIterator, _BinaryPredicate) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _BinaryPredicate = __gnu_cxx::__ops::_Iter_equal_to_iter]’:
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
905 | __unique(_ForwardIterator __first, _ForwardIterator __last,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ 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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:38:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long int> > > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:35:
/usr/include/c++/13/bits/vector.tcc: In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::_M_erase(iterator, iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
195 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::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 long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_edwardMoore<G>::edwardMoore(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_edwardMoore.hpp:90:37:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/bellman_ford/pgr_edwardMoore.hpp:29,
from /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:43:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_edwardMoore<G>::edwardMoore(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_edwardMoore.hpp:93:44:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_edwardMoore<G>::edwardMoore(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_edwardMoore.hpp:90:37:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_edwardMoore<G>::edwardMoore(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/bellman_ford/pgr_edwardMoore.hpp:93:44:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:133:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:133:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:61:14,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:134:36:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:63:24,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:134:36:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:62:18,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:134:36:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:66:14,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:134:36:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:68:24,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:134:36:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:67:18,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:134:36:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:142:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:142:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:61:14,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:144:36:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:63:24,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:144:36:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:62:18,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:144:36:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:66:14,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:144:36:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:68:24,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:144:36:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_edwardMoore(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:67:18,
inlined from ‘void do_pgr_edwardMoore(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:144:36:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 60%] Built target bellman_ford
make -f src/cpp_common/CMakeFiles/cpp_common.dir/build.make src/cpp_common/CMakeFiles/cpp_common.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/cpp_common /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/cpp_common /<<PKGBUILDDIR>>/build-16/src/cpp_common/CMakeFiles/cpp_common.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/cpp_common/CMakeFiles/cpp_common.dir/build.make src/cpp_common/CMakeFiles/cpp_common.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 60%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/Dmatrix.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/Dmatrix.cpp.o -MF CMakeFiles/cpp_common.dir/Dmatrix.cpp.o.d -o CMakeFiles/cpp_common.dir/Dmatrix.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:31:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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>>/include/cpp_common/Dmatrix.h:33,
from /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:26:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::tsp::Dmatrix::set_ids(const std::vector<IID_t_rt>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:48:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::tsp::Dmatrix::set_ids(const std::vector<IID_t_rt>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:49:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void pgrouting::tsp::Dmatrix::set_ids(const std::vector<IID_t_rt>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:51:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘void pgrouting::tsp::Dmatrix::set_ids(const std::vector<IID_t_rt>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:51:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::tsp::Dmatrix::Dmatrix(const std::map<std::pair<double, double>, long long int>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:120:22:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 61%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/compPaths.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/compPaths.cpp.o -MF CMakeFiles/cpp_common.dir/compPaths.cpp.o.d -o CMakeFiles/cpp_common.dir/compPaths.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/compPaths.cpp
[ 61%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/rule.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/rule.cpp.o -MF CMakeFiles/cpp_common.dir/rule.cpp.o.d -o CMakeFiles/cpp_common.dir/rule.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/rule.cpp
[ 62%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/bpoint.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/bpoint.cpp.o -MF CMakeFiles/cpp_common.dir/bpoint.cpp.o.d -o CMakeFiles/cpp_common.dir/bpoint.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/bpoint.cpp
[ 62%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/pgr_messages.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/pgr_messages.cpp.o -MF CMakeFiles/cpp_common.dir/pgr_messages.cpp.o.d -o CMakeFiles/cpp_common.dir/pgr_messages.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/pgr_messages.cpp
[ 63%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/combinations.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/combinations.cpp.o -MF CMakeFiles/cpp_common.dir/combinations.cpp.o.d -o CMakeFiles/cpp_common.dir/combinations.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/cpp_common/combinations.h:34,
from /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:27:
/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<long long int&&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::set<long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::set<long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::set<long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::set<long long int> >, std::_Select1st<std::pair<const long long int, std::set<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::set<long long int> > > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h: In function ‘std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(const_iterator, const key_type&) [with _Key = long long int; _Val = std::pair<const long long int, std::set<long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::set<long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::set<long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2210:5: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::set<long long int> >, std::_Select1st<std::pair<const long long int, std::set<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::set<long long int> > > >::const_iterator’ changed in GCC 7.1
2210 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = long long int; _Tp = std::set<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::set<long long int> > >]’,
inlined from ‘std::map<long long int, std::set<long long int> > pgrouting::utilities::get_combinations(std::deque<pgrouting::Path>&, const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:75:42:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::set<long long int> >, std::_Select1st<std::pair<const long long int, std::set<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::set<long long int> > > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = long long int; _Tp = std::set<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::set<long long int> > >]’,
inlined from ‘std::map<long long int, std::set<long long int> > pgrouting::utilities::get_combinations(std::deque<pgrouting::Path>&, const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:99:46:
/usr/include/c++/13/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::set<long long int> >, std::_Select1st<std::pair<const long long int, std::set<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::set<long long int> > > >::const_iterator’ changed in GCC 7.1
532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | std::forward_as_tuple(std::move(__k)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
534 | std::tuple<>());
| ~~~~~~~~~~~~~~~
[ 63%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/get_check_data.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/get_check_data.cpp.o -MF CMakeFiles/cpp_common.dir/get_check_data.cpp.o.d -o CMakeFiles/cpp_common.dir/get_check_data.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/get_check_data.cpp
[ 64%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/pgdata_fetchers.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/pgdata_fetchers.cpp.o -MF CMakeFiles/cpp_common.dir/pgdata_fetchers.cpp.o.d -o CMakeFiles/cpp_common.dir/pgdata_fetchers.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/pgdata_fetchers.cpp
[ 64%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/pgdata_getters.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/cpp_common/CMakeFiles/cpp_common.dir/pgdata_getters.cpp.o -MF CMakeFiles/cpp_common.dir/pgdata_getters.cpp.o.d -o CMakeFiles/cpp_common.dir/pgdata_getters.cpp.o -c /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp
In file included from /usr/include/c++/13/vector:65,
from /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:37:
/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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’:
/usr/include/c++/13/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_vehicles(char*, Vehicle_t**, size_t*, bool, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:663:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_combinations(char*, II_t_rt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:110:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_restrictions(char*, Restriction_t**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:597:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_matrixRows(char*, IID_t_rt**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:454:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_coordinates(char*, Coordinate_t**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:148:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_points(char*, Point_on_edge_t**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:560:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_delauny(char*, Delauny_t**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:188:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_flow_edges(char*, Edge_t**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:230:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_edges(char*, Edge_t**, size_t*, bool, bool, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:416:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_costFlow_edges(char*, CostFlow_t**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:274:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_basic_edges(char*, Edge_bool_t**, size_t*, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:324:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_edges_xy(char*, Edge_xy_t**, size_t*, bool, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:371:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ 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 pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; bool _TrivialValueTypes = false]’,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*]’ 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 pgrouting::Column_info_t*, vector<pgrouting::Column_info_t> >; _ForwardIterator = pgrouting::Column_info_t*; _Tp = pgrouting::Column_info_t]’ 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 = pgrouting::Column_info_t; _Alloc = std::allocator<pgrouting::Column_info_t>]’ at /usr/include/c++/13/bits/stl_vector.h:603:31,
inlined from ‘void pgr_get_orders(char*, Orders_t**, size_t*, bool, char**)’ at /<<PKGBUILDDIR>>/src/cpp_common/pgdata_getters.cpp:521:28:
/usr/include/c++/13/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<const pgrouting::Column_info_t*, std::vector<pgrouting::Column_info_t> >’ changed in GCC 7.1
137 | { return std::__do_uninit_copy(__first, __last, __result); }
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 64%] Built target cpp_common
make -f src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build.make src/dagShortestPath/CMakeFiles/dagShortestPath.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dagShortestPath /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/dagShortestPath /<<PKGBUILDDIR>>/build-16/src/dagShortestPath/CMakeFiles/dagShortestPath.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build.make src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 65%] Building C object src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath.c.o
cd /<<PKGBUILDDIR>>/build-16/src/dagShortestPath && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath.c.o -MF CMakeFiles/dagShortestPath.dir/dagShortestPath.c.o.d -o CMakeFiles/dagShortestPath.dir/dagShortestPath.c.o -c /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath.c
[ 65%] Building CXX object src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/dagShortestPath && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath_driver.cpp.o -MF CMakeFiles/dagShortestPath.dir/dagShortestPath_driver.cpp.o.d -o CMakeFiles/dagShortestPath.dir/dagShortestPath_driver.cpp.o -c /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:35:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_ForwardIterator std::__unique(_ForwardIterator, _ForwardIterator, _BinaryPredicate) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _BinaryPredicate = __gnu_cxx::__ops::_Iter_equal_to_iter]’:
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
905 | __unique(_ForwardIterator __first, _ForwardIterator __last,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:32,
from /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:37:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long int> > > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::_M_erase(iterator, iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
195 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::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 long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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_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/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_dag<G>::dag(G&, int64_t, const std::vector<long long int>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:106:26:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_dag<G>::dag(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:200:38:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:38:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_dag<G>::dag(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:203:45:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_dag<G>::dag(G&, int64_t, const std::vector<long long int>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:106:26:
/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);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_dag<G>::dag(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:200:38:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::Pgr_dag<G>::dag(G&, const std::vector<II_t_rt>&, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:203:45:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:128:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:128:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:55:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:55:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:57:24,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:56:18,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:60:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:60:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:62:24,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:61:18,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:129:40:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:137:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:137:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:55:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:55:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:57:24,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:56:18,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:60:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:60:14,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:62:24,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_dagShortestPath(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:61:18,
inlined from ‘void do_pgr_dagShortestPath(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:138:40:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 65%] Built target dagShortestPath
make -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/chinese /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/chinese /<<PKGBUILDDIR>>/build-16/src/chinese/CMakeFiles/chinese.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 66%] Building C object src/chinese/CMakeFiles/chinese.dir/chinesePostman.c.o
cd /<<PKGBUILDDIR>>/build-16/src/chinese && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/chinese/CMakeFiles/chinese.dir/chinesePostman.c.o -MF CMakeFiles/chinese.dir/chinesePostman.c.o.d -o CMakeFiles/chinese.dir/chinesePostman.c.o -c /<<PKGBUILDDIR>>/src/chinese/chinesePostman.c
[ 66%] Building CXX object src/chinese/CMakeFiles/chinese.dir/chinesePostman_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/chinese && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/chinese/CMakeFiles/chinese.dir/chinesePostman_driver.cpp.o -MF CMakeFiles/chinese.dir/chinesePostman_driver.cpp.o.d -o CMakeFiles/chinese.dir/chinesePostman_driver.cpp.o -c /<<PKGBUILDDIR>>/src/chinese/chinesePostman_driver.cpp
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/src/chinese/chinesePostman_driver.cpp:35:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, int>, std::_Select1st<std::pair<const long long int, int> >, std::less<long long int>, std::allocator<std::pair<const long long int, int> > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/chinese/chinesePostman_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Edge_t&}; _Tp = Edge_t; _Alloc = std::allocator<Edge_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Edge_t>::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 CostFlow_t&}; _Tp = CostFlow_t; _Alloc = std::allocator<CostFlow_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<CostFlow_t>::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 Path_rt&}; _Tp = Path_rt; _Alloc = std::allocator<Path_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<Path_rt>::iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:31,
from /<<PKGBUILDDIR>>/src/chinese/chinesePostman_driver.cpp:38:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::PgrDirectedChPPGraph::BuildResultGraph()’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:334:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘void pgrouting::graph::PgrDirectedChPPGraph::BuildResultGraph()’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:337:44:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘bool pgrouting::graph::PgrDirectedChPPGraph::EulerCircuitDFS(int64_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:314:52:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Path_rt; _Alloc = std::allocator<Path_rt>]’,
inlined from ‘void pgrouting::graph::PgrDirectedChPPGraph::BuildResultPath()’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:292:29:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ 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 = Path_rt; _Alloc = std::allocator<Path_rt>]’,
inlined from ‘void pgrouting::graph::PgrDirectedChPPGraph::BuildResultPath()’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:306:25:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ 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 std::pair<long long int, long long int>&>, std::tuple<>}; _Key = std::pair<long long int, long long int>; _Val = std::pair<const std::pair<long long int, long long int>, const Edge_t*>; _KeyOfValue = std::_Select1st<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, const Edge_t*>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/max_flow/pgr_minCostMaxFlow.hpp:38,
from /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:38:
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp: In function ‘void boost::successive_shortest_path_nonnegative_weights(const Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, Distance2) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > > >; Capacity = adj_list_edge_property_map<directed_tag, double, const double&, unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_capacity_t>; ResidualCapacity = adj_list_edge_property_map<directed_tag, double, double&, unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_residual_capacity_t>; Reversed = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, unsigned int>, const detail::edge_desc_impl<directed_tag, unsigned int>&, unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_reverse_t>; Pred = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, unsigned int>, detail::edge_desc_impl<directed_tag, unsigned int>, detail::edge_desc_impl<directed_tag, unsigned int>&>; Weight = adj_list_edge_property_map<directed_tag, double, const double&, unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > >, edge_weight_t>; Distance = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<no_property, unsigned int>, double, double&>; Distance2 = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<no_property, unsigned int>, double, double&>; VertexIndex = vec_adj_list_vertex_id_map<no_property, unsigned int>]’:
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:77:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
77 | void successive_shortest_path_nonnegative_weights(const Graph& g,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:77:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>’ changed in GCC 7.1
In function ‘void boost::detail::successive_shortest_path_nonnegative_weights_dispatch3(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, Distance, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > > >; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, unsigned int>, const edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>&>; Distance = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>, double, double&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>]’,
inlined from ‘void boost::detail::successive_shortest_path_nonnegative_weights_dispatch2(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, Pred, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, unsigned int>, const edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_reverse_t>; Pred = boost::iterator_property_map<__gnu_cxx::__normal_iterator<edge_desc_impl<boost::directed_tag, unsigned int>*, std::vector<edge_desc_impl<boost::directed_tag, unsigned int>, std::allocator<edge_desc_impl<boost::directed_tag, unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>, edge_desc_impl<boost::directed_tag, unsigned int>&>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:185:63,
inlined from ‘void boost::detail::successive_shortest_path_nonnegative_weights_dispatch1(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, Capacity, ResidualCapacity, Weight, Reversed, VertexIndex, boost::param_not_found, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; Capacity = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_capacity_t>; ResidualCapacity = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>; Reversed = boost::adj_list_edge_property_map<boost::directed_tag, edge_desc_impl<boost::directed_tag, unsigned int>, const edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_reverse_t>; VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, unsigned int>]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:219:63,
inlined from ‘void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > > >; P = int; T = buffer_param_t; R = no_property]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:234:74,
inlined from ‘void boost::successive_shortest_path_nonnegative_weights(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, unsigned int>, property<edge_weight_t, double> > > > >]’ at /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:251:49,
inlined from ‘double pgrouting::graph::PgrCostFlowGraph::MinCostMaxFlow()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_minCostMaxFlow.hpp:61:61:
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, double&, unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_residual_capacity_t>’ changed in GCC 7.1
150 | successive_shortest_path_nonnegative_weights(g, s, t, capacity,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
151 | residual_capacity, weight, rev, index, pred, dist,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
152 | make_iterator_property_map(d_map.begin(), index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:150:53: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, unsigned int, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::property<boost::edge_weight_t, double> > > >, boost::edge_weight_t>’ changed in GCC 7.1
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::pair<long long int, long long int>; _Tp = const Edge_t*; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >]’,
inlined from ‘void pgrouting::graph::PgrDirectedChPPGraph::setPathEdges(pgrouting::graph::PgrCostFlowGraph&)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:236:57:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, const Edge_t*>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> > >::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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘void pgrouting::graph::PgrDirectedChPPGraph::setPathEdges(pgrouting::graph::PgrCostFlowGraph&)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:238:60:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:126:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = Edge_t; _Alloc = std::allocator<Edge_t>]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:136:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ 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 = long long int; _Tp = int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, int> >]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:150:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, int>, std::_Select1st<std::pair<const long long int, int> >, std::less<long long int>, std::allocator<std::pair<const long long int, 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 = long long int; _Tp = int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, int> >]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:152:21:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, int>, std::_Select1st<std::pair<const long long int, int> >, std::less<long long int>, std::allocator<std::pair<const long long int, 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 = std::pair<long long int, long long int>; _Tp = const Edge_t*; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:156:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, const Edge_t*>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> > >::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::pair<long long int, long long int>; _Tp = const Edge_t*; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:158:39:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, const Edge_t*>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> > >::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::pair<long long int, long long int>; _Tp = const Edge_t*; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:159:39:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, const Edge_t*>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, const Edge_t*> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, const Edge_t*> > >::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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = CostFlow_t; _Alloc = std::allocator<CostFlow_t>]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:171:24:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<CostFlow_t*, std::vector<CostFlow_t> >’ 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 = CostFlow_t; _Alloc = std::allocator<CostFlow_t>]’,
inlined from ‘pgrouting::graph::PgrDirectedChPPGraph::PgrDirectedChPPGraph(const Edge_t*, size_t)’ at /<<PKGBUILDDIR>>/include/chinese/pgr_chinesePostman.hpp:204:24:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<CostFlow_t*, std::vector<CostFlow_t> >’ 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 = Path_rt; _Alloc = std::allocator<Path_rt>]’,
inlined from ‘void do_pgr_directedChPP(Edge_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/chinese/chinesePostman_driver.cpp:80:36:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 66%] Built target chinese
make -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/spanningTree /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/spanningTree /<<PKGBUILDDIR>>/build-16/src/spanningTree/CMakeFiles/spanningTree.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 67%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/mst_common.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/spanningTree/CMakeFiles/spanningTree.dir/mst_common.cpp.o -MF CMakeFiles/spanningTree.dir/mst_common.cpp.o.d -o CMakeFiles/spanningTree.dir/mst_common.cpp.o -c /<<PKGBUILDDIR>>/src/spanningTree/mst_common.cpp
[ 67%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/details.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/spanningTree/CMakeFiles/spanningTree.dir/details.cpp.o -MF CMakeFiles/spanningTree.dir/details.cpp.o.d -o CMakeFiles/spanningTree.dir/details.cpp.o -c /<<PKGBUILDDIR>>/src/spanningTree/details.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:30:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<long long int> pgrouting::details::clean_vids(std::vector<long long int>)’ at /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:37:14:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<long long int> pgrouting::details::clean_vids(std::vector<long long int>)’ at /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:37:14:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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>>/include/spanningTree/details.hpp:32,
from /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:28:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::details::get_no_edge_graph_result(const std::vector<long long int>&)’ at /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:52:26:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 68%] Building C object src/spanningTree/CMakeFiles/spanningTree.dir/kruskal.c.o
cd /<<PKGBUILDDIR>>/build-16/src/spanningTree && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/spanningTree/CMakeFiles/spanningTree.dir/kruskal.c.o -MF CMakeFiles/spanningTree.dir/kruskal.c.o.d -o CMakeFiles/spanningTree.dir/kruskal.c.o -c /<<PKGBUILDDIR>>/src/spanningTree/kruskal.c
[ 68%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/kruskal_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/spanningTree/CMakeFiles/spanningTree.dir/kruskal_driver.cpp.o -MF CMakeFiles/spanningTree.dir/kruskal_driver.cpp.o.d -o CMakeFiles/spanningTree.dir/kruskal_driver.cpp.o -c /<<PKGBUILDDIR>>/src/spanningTree/kruskal_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/spanningTree/kruskal_driver.cpp:33:
/usr/include/c++/13/bits/vector.tcc: In function ‘void std::vector<_Tp, _Alloc>::_M_range_insert(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
751 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
/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 = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
529 | 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::dfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:315:40:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::dfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:317:43:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::functions::Pgr_mst<G>::calculate_component(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:244:26,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::bfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:333:29:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::bfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:351:32:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::bfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:353:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 69%] Building C object src/spanningTree/CMakeFiles/spanningTree.dir/prim.c.o
cd /<<PKGBUILDDIR>>/build-16/src/spanningTree && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/spanningTree/CMakeFiles/spanningTree.dir/prim.c.o -MF CMakeFiles/spanningTree.dir/prim.c.o.d -o CMakeFiles/spanningTree.dir/prim.c.o -c /<<PKGBUILDDIR>>/src/spanningTree/prim.c
[ 69%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/prim_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/spanningTree/CMakeFiles/spanningTree.dir/prim_driver.cpp.o -MF CMakeFiles/spanningTree.dir/prim_driver.cpp.o.d -o CMakeFiles/spanningTree.dir/prim_driver.cpp.o -c /<<PKGBUILDDIR>>/src/spanningTree/prim_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/spanningTree/prim_driver.cpp:33:
/usr/include/c++/13/bits/vector.tcc: In function ‘void std::vector<_Tp, _Alloc>::_M_range_insert(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
751 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
/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 = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
529 | 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::set<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::less<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> >, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:198:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::get_results(T, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:215:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::dfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:315:40:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::dfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:317:43:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘void pgrouting::functions::Pgr_mst<G>::calculate_component(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:244:26,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::bfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:333:29:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::bfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:351:32:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_mst<G>::bfs_ordering(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/spanningTree/pgr_mst.hpp:353:35:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 69%] Built target spanningTree
make -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mincut /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/mincut /<<PKGBUILDDIR>>/build-16/src/mincut/CMakeFiles/mincut.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 70%] Building C object src/mincut/CMakeFiles/mincut.dir/stoerWagner.c.o
cd /<<PKGBUILDDIR>>/build-16/src/mincut && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/mincut/CMakeFiles/mincut.dir/stoerWagner.c.o -MF CMakeFiles/mincut.dir/stoerWagner.c.o.d -o CMakeFiles/mincut.dir/stoerWagner.c.o -c /<<PKGBUILDDIR>>/src/mincut/stoerWagner.c
[ 70%] Building CXX object src/mincut/CMakeFiles/mincut.dir/stoerWagner_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/mincut && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/mincut/CMakeFiles/mincut.dir/stoerWagner_driver.cpp.o -MF CMakeFiles/mincut.dir/stoerWagner_driver.cpp.o.d -o CMakeFiles/mincut.dir/stoerWagner_driver.cpp.o -c /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp:33:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const StoerWagner_t&}; _Tp = StoerWagner_t; _Alloc = std::allocator<StoerWagner_t>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<StoerWagner_t>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/boost/graph/stoer_wagner_min_cut.hpp:18,
from /<<PKGBUILDDIR>>/include/mincut/pgr_stoerWagner.hpp:44,
from /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp:35:
/usr/include/boost/graph/maximum_adjacency_search.hpp: In function ‘void boost::detail::maximum_adjacency_search(const Graph&, WeightMap, MASVisitor, typename boost::graph_traits<Graph>::vertex_descriptor, VertexAssignmentMap, KeyedUpdatablePriorityQueue) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; MASVisitor = mas_min_cut_visitor<boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; VertexAssignmentMap = boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<unsigned int, 4, boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::shared_array_property_map<double, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > >]’:
/usr/include/boost/graph/maximum_adjacency_search.hpp:117:10: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
117 | void maximum_adjacency_search(const Graph& g, WeightMap weights,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/maximum_adjacency_search.hpp: In function ‘void boost::maximum_adjacency_search(const Graph&, WeightMap, MASVisitor, typename graph_traits<Graph>::vertex_descriptor, VertexAssignmentMap, KeyedUpdatablePriorityQueue) [with Graph = adjacency_list<vecS, vecS, undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; MASVisitor = detail::mas_min_cut_visitor<one_bit_color_map<vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; VertexAssignmentMap = shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; KeyedUpdatablePriorityQueue = d_ary_heap_indirect<unsigned int, 4, shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, shared_array_property_map<double, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > >]’:
/usr/include/boost/graph/maximum_adjacency_search.hpp:213:6: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
213 | void maximum_adjacency_search(const Graph& g, WeightMap weights, MASVisitor vis,
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/maximum_adjacency_search.hpp:249:37: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
249 | detail::maximum_adjacency_search(g, weights, vis, start, assignments, pq);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/stoer_wagner_min_cut.hpp: In function ‘typename boost::property_traits<IndexMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&, IndexMap) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; ParityMap = boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; VertexAssignmentMap = boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<unsigned int, 4, boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::shared_array_property_map<double, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > >; IndexMap = boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>]’:
/usr/include/boost/graph/stoer_wagner_min_cut.hpp:150:5: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
150 | stoer_wagner_min_cut(const UndirectedGraph& g, WeightMap weights,
| ^~~~~~~~~~~~~~~~~~~~
In static member function ‘static boost::graph::detail::mas_dispatch<WeightMap>::result_type boost::graph::detail::mas_dispatch<WeightMap>::apply(const Graph&, const ArgPack&, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<unsigned int, 4, boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::shared_array_property_map<double, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>]’,
inlined from ‘void boost::maximum_adjacency_search(const Graph&, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; P = reference_wrapper<d_ary_heap_indirect<unsigned int, 4, shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, shared_array_property_map<double, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > > >; T = max_priority_queue_t; R = bgl_named_params<shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, vertex_assignment_map_t, bgl_named_params<unsigned int, root_vertex_t, bgl_named_params<detail::mas_min_cut_visitor<one_bit_color_map<vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, graph_visitor_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, edge_weight_t, no_property> > > >]’ at /usr/include/boost/graph/maximum_adjacency_search.hpp:369:44,
inlined from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&, IndexMap) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; ParityMap = boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; VertexAssignmentMap = boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<unsigned int, 4, boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::shared_array_property_map<double, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > >; IndexMap = boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>]’ at /usr/include/boost/graph/stoer_wagner_min_cut.hpp:175:44:
/usr/include/boost/graph/maximum_adjacency_search.hpp:296:48: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
296 | boost::maximum_adjacency_search(g, w,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
297 | params[_visitor | default_visitor],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params[_root_vertex | *vertices(g).first],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
299 | params[_vertex_assignment_map | default_map], pq);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In static member function ‘static boost::graph::detail::mas_dispatch<WeightMap>::result_type boost::graph::detail::mas_dispatch<WeightMap>::apply(const Graph&, const ArgPack&, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<unsigned int, 4, boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::shared_array_property_map<double, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>]’,
inlined from ‘void boost::maximum_adjacency_search(const Graph&, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; P = reference_wrapper<d_ary_heap_indirect<unsigned int, 4, shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, shared_array_property_map<double, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > > >; T = max_priority_queue_t; R = bgl_named_params<unsigned int, root_vertex_t, bgl_named_params<detail::mas_min_cut_visitor<one_bit_color_map<vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, graph_visitor_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>, edge_weight_t, bgl_named_params<shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, vertex_assignment_map_t, no_property> > > >]’ at /usr/include/boost/graph/maximum_adjacency_search.hpp:369:44,
inlined from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&, IndexMap) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; ParityMap = boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; VertexAssignmentMap = boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<unsigned int, 4, boost::shared_array_property_map<unsigned int, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, boost::shared_array_property_map<double, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > >; IndexMap = boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>]’ at /usr/include/boost/graph/stoer_wagner_min_cut.hpp:191:40:
/usr/include/boost/graph/maximum_adjacency_search.hpp:296:48: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
296 | boost::maximum_adjacency_search(g, w,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
297 | params[_visitor | default_visitor],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params[_root_vertex | *vertices(g).first],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
299 | params[_vertex_assignment_map | default_map], pq);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘typename boost::property_traits<IndexMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&, IndexMap) [with UndirectedGraph = adjacency_list<vecS, vecS, undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; ParityMap = one_bit_color_map<vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; VertexAssignmentMap = shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; KeyedUpdatablePriorityQueue = d_ary_heap_indirect<unsigned int, 4, shared_array_property_map<unsigned int, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, shared_array_property_map<double, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >, std::greater<double>, std::vector<unsigned int, std::allocator<unsigned int> > >; IndexMap = vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>]’,
inlined from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>]’ at /usr/include/boost/graph/stoer_wagner_min_cut.hpp:283:51,
inlined from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; Param1 = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::parity_map, const boost::one_bit_color_map<boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ at /usr/include/boost/graph/stoer_wagner_min_cut.hpp:294:5,
inlined from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; Param1 = adj_list_edge_property_map<undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>; P = one_bit_color_map<vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int> >; T = parity_map_t; R = no_property]’ at /usr/include/boost/graph/stoer_wagner_min_cut.hpp:298:1,
inlined from ‘std::vector<StoerWagner_t> Pgr_stoerWagner<G>::generatestoerWagner(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/mincut/pgr_stoerWagner.hpp:77:39,
inlined from ‘std::vector<StoerWagner_t> Pgr_stoerWagner<G>::stoerWagner(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/mincut/pgr_stoerWagner.hpp:117:35,
inlined from ‘std::vector<StoerWagner_t> {anonymous}::pgr_stoerWagner(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp:47:44,
inlined from ‘void do_pgr_stoerWagner(Edge_t*, size_t, StoerWagner_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp:84:34:
/usr/include/boost/graph/stoer_wagner_min_cut.hpp:245:40: note: parameter passing for argument of type ‘boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, unsigned int, const pgrouting::Basic_edge, double pgrouting::Basic_edge::*>’ changed in GCC 7.1
245 | return detail::stoer_wagner_min_cut(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
246 | g, weights, parities, assignments, pq, index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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 = StoerWagner_t; _Alloc = std::allocator<StoerWagner_t>]’,
inlined from ‘std::vector<StoerWagner_t> Pgr_stoerWagner<G>::generatestoerWagner(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/mincut/pgr_stoerWagner.hpp:102:33,
inlined from ‘std::vector<StoerWagner_t> Pgr_stoerWagner<G>::stoerWagner(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/mincut/pgr_stoerWagner.hpp:117:35,
inlined from ‘std::vector<StoerWagner_t> {anonymous}::pgr_stoerWagner(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp:47:44,
inlined from ‘void do_pgr_stoerWagner(Edge_t*, size_t, StoerWagner_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp:84:34:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<StoerWagner_t*, std::vector<StoerWagner_t> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 70%] Built target mincut
make -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/version /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/version /<<PKGBUILDDIR>>/build-16/src/version/CMakeFiles/version.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 70%] Building C object src/version/CMakeFiles/version.dir/version.c.o
cd /<<PKGBUILDDIR>>/build-16/src/version && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/version/CMakeFiles/version.dir/version.c.o -MF CMakeFiles/version.dir/version.c.o.d -o CMakeFiles/version.dir/version.c.o -c /<<PKGBUILDDIR>>/src/version/version.c
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 70%] Built target version
make -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/topologicalSort /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/topologicalSort /<<PKGBUILDDIR>>/build-16/src/topologicalSort/CMakeFiles/topologicalSort.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 71%] Building C object src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort.c.o
cd /<<PKGBUILDDIR>>/build-16/src/topologicalSort && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort.c.o -MF CMakeFiles/topologicalSort.dir/topologicalSort.c.o.d -o CMakeFiles/topologicalSort.dir/topologicalSort.c.o -c /<<PKGBUILDDIR>>/src/topologicalSort/topologicalSort.c
[ 71%] Building CXX object src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/topologicalSort && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort_driver.cpp.o -MF CMakeFiles/topologicalSort.dir/topologicalSort_driver.cpp.o.d -o CMakeFiles/topologicalSort.dir/topologicalSort_driver.cpp.o -c /<<PKGBUILDDIR>>/src/topologicalSort/topologicalSort_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/topologicalSort/topologicalSort_driver.cpp:34:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const I_rt&}; _Tp = I_rt; _Alloc = std::allocator<I_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<I_rt>::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 = I_rt; _Alloc = std::allocator<I_rt>]’,
inlined from ‘std::vector<I_rt> Pgr_topologicalSort<G>::generatetopologicalSort(const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/topologicalSort/pgr_topologicalSort.hpp:85:30,
inlined from ‘std::vector<I_rt> Pgr_topologicalSort<G>::topologicalSort(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/topologicalSort/pgr_topologicalSort.hpp:97:35,
inlined from ‘std::vector<I_rt> {anonymous}::pgr_topologicalSort(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/topologicalSort/topologicalSort_driver.cpp:51:52,
inlined from ‘void do_pgr_topologicalSort(Edge_t*, size_t, I_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/topologicalSort/topologicalSort_driver.cpp:91:38:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<I_rt*, std::vector<I_rt> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 71%] Built target topologicalSort
make -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/transitiveClosure /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/transitiveClosure /<<PKGBUILDDIR>>/build-16/src/transitiveClosure/CMakeFiles/transitiveClosure.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 72%] Building C object src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure.c.o
cd /<<PKGBUILDDIR>>/build-16/src/transitiveClosure && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure.c.o -MF CMakeFiles/transitiveClosure.dir/transitiveClosure.c.o.d -o CMakeFiles/transitiveClosure.dir/transitiveClosure.c.o -c /<<PKGBUILDDIR>>/src/transitiveClosure/transitiveClosure.c
[ 72%] Building CXX object src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/transitiveClosure && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure_driver.cpp.o -MF CMakeFiles/transitiveClosure.dir/transitiveClosure_driver.cpp.o.d -o CMakeFiles/transitiveClosure.dir/transitiveClosure_driver.cpp.o -c /<<PKGBUILDDIR>>/src/transitiveClosure/transitiveClosure_driver.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 72%] Built target transitiveClosure
make -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 73%] Building C object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch.c.o
cd /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch.c.o -MF CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch.c.o.d -o CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch.c.o -c /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch.c
[ 73%] Building CXX object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch_driver.cpp.o -MF CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch_driver.cpp.o.d -o CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch_driver.cpp.o -c /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:33:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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/breadthFirstSearch/breadthFirstSearch_driver.cpp:32:
/usr/include/c++/13/bits/vector.tcc: In function ‘void std::vector<_Tp, _Alloc>::_M_range_insert(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
751 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:34,
from /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:33,
from /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:39:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:61:34:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::get_results(T, int64_t, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:96:35,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:66:22:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:67:31:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:61:34:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::get_results(T, int64_t, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:96:35,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:66:22:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_breadthFirstSearch<G>::breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:67:31:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:35:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:102:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:102:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:49:14,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:103:45:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:49:14,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:103:45:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:111:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:111:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:49:14,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:113:45:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:49:14,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:113:45:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:49:14,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:103:45:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_breadthFirstSearch(G&, std::vector<long long int>, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:49:14,
inlined from ‘void do_pgr_breadthFirstSearch(Edge_t*, size_t, int64_t*, size_t, int64_t, bool, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:113:45:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
[ 74%] Building C object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch.c.o
cd /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch.c.o -MF CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch.c.o.d -o CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch.c.o -c /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch.c
[ 74%] Building CXX object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch_driver.cpp.o -MF CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch_driver.cpp.o.d -o CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch_driver.cpp.o -c /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:36:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/usr/include/c++/13/bits/stl_algo.h: In function ‘_ForwardIterator std::__unique(_ForwardIterator, _ForwardIterator, _BinaryPredicate) [with _ForwardIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _BinaryPredicate = __gnu_cxx::__ops::_Iter_equal_to_iter]’:
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
905 | __unique(_ForwardIterator __first, _ForwardIterator __last,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:905:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’:
/usr/include/c++/13/bits/stl_algo.h:1942:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ 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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/set:62,
from /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:38:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned int> > >::const_iterator’ changed in GCC 7.1
2458 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, std::vector<long long int> >; _KeyOfValue = std::_Select1st<std::pair<const long long int, std::vector<long long int> > >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long int> > > >::const_iterator’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:35:
/usr/include/c++/13/bits/vector.tcc: In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::_M_erase(iterator, iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
195 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:195:5: note: parameter passing for argument of type ‘std::vector<long long int>::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 long long int&}; _Tp = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<long long 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 = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_binaryBreadthFirstSearch<G>::binaryBreadthFirstSearch(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_binaryBreadthFirstSearch.hpp:93:37:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1289 | _M_realloc_insert(end(), __x);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/map:63,
from /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_binaryBreadthFirstSearch.hpp:33,
from /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:40:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_binaryBreadthFirstSearch<G>::binaryBreadthFirstSearch(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_binaryBreadthFirstSearch.hpp:96:44:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_binaryBreadthFirstSearch<G>::binaryBreadthFirstSearch(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_binaryBreadthFirstSearch.hpp:93:37:
/usr/include/c++/13/bits/stl_vector.h:1289:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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 = long long int; _Tp = std::vector<long long int>; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, std::vector<long long int> > >]’,
inlined from ‘std::deque<pgrouting::Path> pgrouting::functions::Pgr_binaryBreadthFirstSearch<G>::binaryBreadthFirstSearch(G&, const std::vector<II_t_rt>&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_binaryBreadthFirstSearch.hpp:96:44:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, std::vector<long long int> >, std::_Select1st<std::pair<const long long int, std::vector<long long int> > >, std::less<long long int>, std::allocator<std::pair<const long long int, std::vector<long long 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:159:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:159:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:54:14,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:166:49:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:56:24,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:166:49:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:55:18,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:166:49:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:59:14,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:166:49:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:61:24,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:166:49:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:60:18,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:166:49:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:175:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:175:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:54:14,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:183:49:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:56:24,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:183:49:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:55:18,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:183:49:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:59:14,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:183:49:
/usr/include/c++/13/bits/stl_algo.h:4861:18: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
4861 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘_FIter std::unique(_FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:61:24,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:183:49:
/usr/include/c++/13/bits/stl_algo.h:948:27: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
948 | return std::__unique(__first, __last,
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
949 | __gnu_cxx::__ops::__iter_equal_to_iter());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::erase(const_iterator, const_iterator) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘std::deque<pgrouting::Path> {anonymous}::pgr_binaryBreadthFirstSearch(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:60:18,
inlined from ‘void do_pgr_binaryBreadthFirstSearch(Edge_t*, size_t, II_t_rt*, size_t, int64_t*, size_t, int64_t*, size_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:183:49:
/usr/include/c++/13/bits/stl_vector.h:1563:24: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1563 | return _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 74%] Built target breadthFirstSearch
make -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/traversal /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/traversal /<<PKGBUILDDIR>>/build-16/src/traversal/CMakeFiles/traversal.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 75%] Building C object src/traversal/CMakeFiles/traversal.dir/depthFirstSearch.c.o
cd /<<PKGBUILDDIR>>/build-16/src/traversal && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/traversal/CMakeFiles/traversal.dir/depthFirstSearch.c.o -MF CMakeFiles/traversal.dir/depthFirstSearch.c.o.d -o CMakeFiles/traversal.dir/depthFirstSearch.c.o -c /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch.c
[ 75%] Building CXX object src/traversal/CMakeFiles/traversal.dir/depthFirstSearch_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/traversal && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/traversal/CMakeFiles/traversal.dir/depthFirstSearch_driver.cpp.o -MF CMakeFiles/traversal.dir/depthFirstSearch_driver.cpp.o.d -o CMakeFiles/traversal.dir/depthFirstSearch_driver.cpp.o -c /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:32:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Distance = int; _Tp = long long int; _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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ 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<long long int*, std::vector<long long int> >’ 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::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:31:
/usr/include/c++/13/bits/vector.tcc: In function ‘void std::vector<_Tp, _Alloc>::_M_range_insert(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
751 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
/usr/include/c++/13/bits/vector.tcc:751:7: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:62,
from /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:29,
from /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:38:
/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 long long int&>, std::tuple<>}; _Key = long long int; _Val = std::pair<const long long int, unsigned int>; _KeyOfValue = std::_Select1st<std::pair<const long long int, unsigned int> >; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’:
/usr/include/c++/13/bits/stl_tree.h:2458:7: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::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 = long long int; _Alloc = std::allocator<long long int>]’:
/usr/include/c++/13/bits/vector.tcc:529:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
529 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:88:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::visitors::Dfs_visitor<V, E, G>::Dfs_visitor(V, std::vector<E>&, int64_t, std::vector<boost::default_color_type>&, G&) [with V = unsigned int; E = boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/visitors/dfs_visitor.hpp:58:28,
inlined from ‘bool pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch_single_vertex(G&, V, std::vector<typename G::E>&, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:141:15,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:94:48:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::get_results(T, int64_t, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:198:35,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:96:23:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:97:32:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:88:31:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]’,
inlined from ‘pgrouting::visitors::Dfs_visitor<V, E, G>::Dfs_visitor(V, std::vector<E>&, int64_t, std::vector<boost::default_color_type>&, G&) [with V = unsigned int; E = boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/visitors/dfs_visitor.hpp:58:28,
inlined from ‘bool pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch_single_vertex(G&, V, std::vector<typename G::E>&, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:141:15,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:94:48:
/usr/include/c++/13/bits/stl_vector.h:1034:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1034 | _M_fill_insert(end(), __new_size - size(), __x);
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {MST_rt}; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::get_results(T, int64_t, int64_t, const G&) [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int> > >; G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:198:35,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:96:23:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; <template-parameter-2-2> = void; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
inlined from ‘std::vector<MST_rt> pgrouting::functions::Pgr_depthFirstSearch<G>::depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:97:32:
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
1483 | _M_range_insert(begin() + __offset, __first, __last,
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1484 | std::__iterator_category(__first));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1483:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/map:63:
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:146:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:146:33:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:68:14,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:148:43:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:68:14,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:148:43:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:952:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:155:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 = long long int; _Tp = unsigned int; _Compare = std::less<long long int>; _Alloc = std::allocator<std::pair<const long long int, unsigned int> >]’,
inlined from ‘pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::V pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::get_V(const T_V&) [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:523:26,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::graph_add_edge(const T&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:953:22,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const std::vector<T>&, bool) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:411:28,
inlined from ‘void pgrouting::graph::Pgr_base_graph<G, Vertex, Edge>::insert_edges(const T*, size_t) [with T = Edge_t; G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; T_V = pgrouting::Basic_vertex; T_E = pgrouting::Basic_edge]’ at /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:364:26,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:155:35:
/usr/include/c++/13/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree<long long int, std::pair<const long long int, unsigned int>, std::_Select1st<std::pair<const long long int, unsigned int> >, std::less<long long int>, std::allocator<std::pair<const long long int, unsigned 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 function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:68:14,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:157:43:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >; _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<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:68:14,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:157:43:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long 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<long long int*, std::vector<long long 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:68:14,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:148:43:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ 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<long long int*, vector<long long int> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’,
inlined from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<long long int*, vector<long long int> >]’ at /usr/include/c++/13/bits/stl_algo.h:4861:18,
inlined from ‘std::vector<MST_rt> {anonymous}::pgr_depthFirstSearch(G&, std::vector<long long int>, bool, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:68:14,
inlined from ‘void do_pgr_depthFirstSearch(Edge_t*, size_t, int64_t*, size_t, bool, int64_t, MST_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:157:43:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 75%] Built target traversal
make -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/coloring /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/coloring /<<PKGBUILDDIR>>/build-16/src/coloring/CMakeFiles/coloring.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 76%] Building C object src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring.c.o
cd /<<PKGBUILDDIR>>/build-16/src/coloring && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring.c.o -MF CMakeFiles/coloring.dir/sequentialVertexColoring.c.o.d -o CMakeFiles/coloring.dir/sequentialVertexColoring.c.o -c /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring.c
[ 76%] Building CXX object src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring_driver.cpp.o -MF CMakeFiles/coloring.dir/sequentialVertexColoring_driver.cpp.o.d -o CMakeFiles/coloring.dir/sequentialVertexColoring_driver.cpp.o -c /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp
In file included from /usr/include/c++/13/bits/stl_algo.h:61,
from /usr/include/c++/13/algorithm:61,
from /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:33:
/usr/include/c++/13/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Distance = int; _Tp = II_t_rt; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)> >]’:
/usr/include/c++/13/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1812:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:32:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::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<II_t_rt*, vector<II_t_rt> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)> >]’:
/usr/include/c++/13/bits/stl_algo.h:1918:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1932 | std::__introsort_loop(__cut, __last, __depth_limit, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_sequentialVertexColoring<G>::get_results(std::vector<unsigned int>&, const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_sequentialVertexColoring.hpp:134:31,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_sequentialVertexColoring<G>::sequentialVertexColoring(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_sequentialVertexColoring.hpp:107:18,
inlined from ‘std::vector<II_t_rt> {anonymous}::pgr_sequentialVertexColoring(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:57:10,
inlined from ‘void do_pgr_sequentialVertexColoring(Edge_t*, size_t, II_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:117:47:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)> >]’,
inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_sequentialVertexColoring<G>::get_results(std::vector<unsigned int>&, const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_sequentialVertexColoring.hpp:138:19,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_sequentialVertexColoring<G>::sequentialVertexColoring(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_sequentialVertexColoring.hpp:107:18,
inlined from ‘std::vector<II_t_rt> {anonymous}::pgr_sequentialVertexColoring(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:57:10,
inlined from ‘void do_pgr_sequentialVertexColoring(Edge_t*, size_t, II_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:117:47:
/usr/include/c++/13/bits/stl_algo.h:1947:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1947 | std::__introsort_loop(__first, __last,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
1948 | std::__lg(__last - __first) * 2,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1949 | __comp);
| ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)> >]’,
inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)> >]’ 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<II_t_rt*, vector<II_t_rt> >; _Compare = pgrouting::functions::Pgr_sequentialVertexColoring<pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge> >::get_results(std::vector<unsigned int>&, const pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>&)::<lambda(II_t_rt, II_t_rt)>]’ at /usr/include/c++/13/bits/stl_algo.h:4894:18,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_sequentialVertexColoring<G>::get_results(std::vector<unsigned int>&, const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_sequentialVertexColoring.hpp:138:19,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_sequentialVertexColoring<G>::sequentialVertexColoring(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_sequentialVertexColoring.hpp:107:18,
inlined from ‘std::vector<II_t_rt> {anonymous}::pgr_sequentialVertexColoring(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:57:10,
inlined from ‘void do_pgr_sequentialVertexColoring(Edge_t*, size_t, II_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:117:47:
/usr/include/c++/13/bits/stl_algo.h:1859:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
1864 | std::__insertion_sort(__first, __last, __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 77%] Building C object src/coloring/CMakeFiles/coloring.dir/bipartite.c.o
cd /<<PKGBUILDDIR>>/build-16/src/coloring && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/coloring/CMakeFiles/coloring.dir/bipartite.c.o -MF CMakeFiles/coloring.dir/bipartite.c.o.d -o CMakeFiles/coloring.dir/bipartite.c.o -c /<<PKGBUILDDIR>>/src/coloring/bipartite.c
[ 77%] Building CXX object src/coloring/CMakeFiles/coloring.dir/bipartite_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/coloring/CMakeFiles/coloring.dir/bipartite_driver.cpp.o -MF CMakeFiles/coloring.dir/bipartite_driver.cpp.o.d -o CMakeFiles/coloring.dir/bipartite_driver.cpp.o -c /<<PKGBUILDDIR>>/src/coloring/bipartite_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/coloring/bipartite_driver.cpp:38:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_Bipartite<G>::print_Bipartite(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_bipartite_driver.hpp:81:42,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_Bipartite<G>::pgr_bipartite(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_bipartite_driver.hpp:89:40,
inlined from ‘void do_pgr_bipartite(Edge_t*, size_t, II_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/coloring/bipartite_driver.cpp:84:45:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ 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 = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_Bipartite<G>::print_Bipartite(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_bipartite_driver.hpp:81:75,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_Bipartite<G>::pgr_bipartite(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/coloring/pgr_bipartite_driver.hpp:89:40,
inlined from ‘void do_pgr_bipartite(Edge_t*, size_t, II_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/coloring/bipartite_driver.cpp:84:45:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 78%] Building C object src/coloring/CMakeFiles/coloring.dir/edgeColoring.c.o
cd /<<PKGBUILDDIR>>/build-16/src/coloring && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/coloring/CMakeFiles/coloring.dir/edgeColoring.c.o -MF CMakeFiles/coloring.dir/edgeColoring.c.o.d -o CMakeFiles/coloring.dir/edgeColoring.c.o -c /<<PKGBUILDDIR>>/src/coloring/edgeColoring.c
[ 78%] Building CXX object src/coloring/CMakeFiles/coloring.dir/edgeColoring_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/coloring/CMakeFiles/coloring.dir/edgeColoring_driver.cpp.o -MF CMakeFiles/coloring.dir/edgeColoring_driver.cpp.o.d -o CMakeFiles/coloring.dir/edgeColoring_driver.cpp.o -c /<<PKGBUILDDIR>>/src/coloring/edgeColoring_driver.cpp
[ 79%] Building CXX object src/coloring/CMakeFiles/coloring.dir/pgr_edgeColoring.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/coloring/CMakeFiles/coloring.dir/pgr_edgeColoring.cpp.o -MF CMakeFiles/coloring.dir/pgr_edgeColoring.cpp.o.d -o CMakeFiles/coloring.dir/pgr_edgeColoring.cpp.o -c /<<PKGBUILDDIR>>/src/coloring/pgr_edgeColoring.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/include/coloring/pgr_edgeColoring.hpp:32,
from /<<PKGBUILDDIR>>/src/coloring/pgr_edgeColoring.cpp:29:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_edgeColoring::edgeColoring()’ at /<<PKGBUILDDIR>>/src/coloring/pgr_edgeColoring.cpp:63:26:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 79%] Built target coloring
make -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/planar /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/planar /<<PKGBUILDDIR>>/build-16/src/planar/CMakeFiles/planar.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 80%] Building C object src/planar/CMakeFiles/planar.dir/isPlanar.c.o
cd /<<PKGBUILDDIR>>/build-16/src/planar && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/planar/CMakeFiles/planar.dir/isPlanar.c.o -MF CMakeFiles/planar.dir/isPlanar.c.o.d -o CMakeFiles/planar.dir/isPlanar.c.o -c /<<PKGBUILDDIR>>/src/planar/isPlanar.c
[ 80%] Building CXX object src/planar/CMakeFiles/planar.dir/isPlanar_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/planar && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/planar/CMakeFiles/planar.dir/isPlanar_driver.cpp.o -MF CMakeFiles/planar.dir/isPlanar_driver.cpp.o.d -o CMakeFiles/planar.dir/isPlanar_driver.cpp.o -c /<<PKGBUILDDIR>>/src/planar/isPlanar_driver.cpp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 80%] Built target planar
make -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dominator /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/dominator /<<PKGBUILDDIR>>/build-16/src/dominator/CMakeFiles/dominator.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 81%] Building C object src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree.c.o
cd /<<PKGBUILDDIR>>/build-16/src/dominator && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree.c.o -MF CMakeFiles/dominator.dir/lengauerTarjanDominatorTree.c.o.d -o CMakeFiles/dominator.dir/lengauerTarjanDominatorTree.c.o -c /<<PKGBUILDDIR>>/src/dominator/lengauerTarjanDominatorTree.c
[ 81%] Building CXX object src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/dominator && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree_driver.cpp.o -MF CMakeFiles/dominator.dir/lengauerTarjanDominatorTree_driver.cpp.o.d -o CMakeFiles/dominator.dir/lengauerTarjanDominatorTree_driver.cpp.o -c /<<PKGBUILDDIR>>/src/dominator/lengauerTarjanDominatorTree_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/dominator/lengauerTarjanDominatorTree_driver.cpp:36:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/dominator/pgr_lengauerTarjanDominatorTree_driver.hpp:39,
from /<<PKGBUILDDIR>>/src/dominator/lengauerTarjanDominatorTree_driver.cpp:44:
/usr/include/boost/graph/dominator_tree.hpp: In function ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; IndexMap = vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int> > >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, unsigned int, unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int> > >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, unsigned int, unsigned int&>; VertexVector = std::vector<unsigned int, std::allocator<unsigned int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, long long int, long long int&>]’:
/usr/include/boost/graph/dominator_tree.hpp:236:6: note: parameter passing for argument of type ‘boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, long long int, long long int&>’ changed in GCC 7.1
236 | void lengauer_tarjan_dominator_tree_without_dfs(const Graph& g,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/boost/graph/dominator_tree.hpp: In function ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, long long int, long long int&>]’:
/usr/include/boost/graph/dominator_tree.hpp:328:6: note: parameter passing for argument of type ‘boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, long long int, long long int&>’ changed in GCC 7.1
328 | void lengauer_tarjan_dominator_tree(const Graph& g,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In function ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; IndexMap = vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int> > >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, unsigned int, unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<unsigned int*, std::vector<unsigned int, std::allocator<unsigned int> > >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, unsigned int, unsigned int&>; VertexVector = std::vector<unsigned int, std::allocator<unsigned int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, long long int, long long int&>]’,
inlined from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >, vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, long long int, long long int&>]’ at /usr/include/boost/graph/dominator_tree.hpp:360:35:
/usr/include/boost/graph/dominator_tree.hpp:317:47: note: parameter passing for argument of type ‘boost::iterator_property_map<__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >, boost::vec_adj_list_vertex_id_map<pgrouting::Basic_vertex, unsigned int>, long long int, long long int&>’ changed in GCC 7.1
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_LTDTree<G>::pgr_ltdtree(G&, int64_t) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dominator/pgr_lengauerTarjanDominatorTree_driver.hpp:86:38,
inlined from ‘void do_pgr_LTDTree(Edge_t*, size_t, int64_t, II_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dominator/lengauerTarjanDominatorTree_driver.cpp:87:41:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 81%] Built target dominator
make -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ordering /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/ordering /<<PKGBUILDDIR>>/build-16/src/ordering/CMakeFiles/ordering.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 82%] Building C object src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering.c.o
cd /<<PKGBUILDDIR>>/build-16/src/ordering && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wsign-conversion -MD -MT src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering.c.o -MF CMakeFiles/ordering.dir/cuthillMckeeOrdering.c.o.d -o CMakeFiles/ordering.dir/cuthillMckeeOrdering.c.o -c /<<PKGBUILDDIR>>/src/ordering/cuthillMckeeOrdering.c
[ 82%] Building CXX object src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-16/src/ordering && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=161 -DPROJECT_VERSION=\"3.6.0\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/16/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -std=c++11 -Wsign-conversion -MD -MT src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering_driver.cpp.o -MF CMakeFiles/ordering.dir/cuthillMckeeOrdering_driver.cpp.o.d -o CMakeFiles/ordering.dir/cuthillMckeeOrdering_driver.cpp.o -c /<<PKGBUILDDIR>>/src/ordering/cuthillMckeeOrdering_driver.cpp
In file included from /usr/include/c++/13/vector:72,
from /<<PKGBUILDDIR>>/src/ordering/cuthillMckeeOrdering_driver.cpp:30:
/usr/include/c++/13/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’:
/usr/include/c++/13/bits/vector.tcc:445:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
445 | vector<_Tp, _Alloc>::
| ^~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {II_t_rt}; _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = II_t_rt; _Alloc = std::allocator<II_t_rt>]’ at /usr/include/c++/13/bits/stl_vector.h:1296:21,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::CuthillMckeeOrdering<G>::get_results(std::vector<unsigned int>&, const G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/ordering/cuthillMckeeOrdering.hpp:148:30,
inlined from ‘std::vector<II_t_rt> pgrouting::functions::CuthillMckeeOrdering<G>::cuthillMckeeOrdering(G&) [with G = pgrouting::graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, pgrouting::Basic_vertex, pgrouting::Basic_edge>, pgrouting::Basic_vertex, pgrouting::Basic_edge>]’ at /<<PKGBUILDDIR>>/include/ordering/cuthillMckeeOrdering.hpp:122:18:
/usr/include/c++/13/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
123 | _M_realloc_insert(end(), std::forward<_Args>(__args)...);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 82%] Built target ordering
make -f CMakeFiles/pgrouting-3.6.dir/build.make CMakeFiles/pgrouting-3.6.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/CMakeFiles/pgrouting-3.6.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f CMakeFiles/pgrouting-3.6.dir/build.make CMakeFiles/pgrouting-3.6.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 83%] Linking CXX shared library lib/libpgrouting-3.6.so
/usr/bin/cmake -E cmake_link_script CMakeFiles/pgrouting-3.6.dir/link.txt --verbose=1
/usr/bin/c++ -fPIC -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -frounding-math -O3 -DNDEBUG -Wl,-z,relro -Wl,-z,now -shared -Wl,-soname,libpgrouting-3.6.so -o lib/libpgrouting-3.6.so src/common/CMakeFiles/common.dir/postgres_connection.c.o src/common/CMakeFiles/common.dir/e_report.c.o src/common/CMakeFiles/common.dir/basePath_SSEC.cpp.o src/common/CMakeFiles/common.dir/check_parameters.c.o src/common/CMakeFiles/common.dir/time_msg.c.o src/common/CMakeFiles/common.dir/pgr_assert.cpp.o src/common/CMakeFiles/common.dir/identifier.cpp.o src/common/CMakeFiles/common.dir/basic_vertex.cpp.o src/common/CMakeFiles/common.dir/xy_vertex.cpp.o src/common/CMakeFiles/common.dir/ch_vertex.cpp.o src/common/CMakeFiles/common.dir/ch_edge.cpp.o src/common/CMakeFiles/common.dir/basic_edge.cpp.o src/common/CMakeFiles/common.dir/pgr_alloc.cpp.o src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra.c.o src/dijkstra/CMakeFiles/dijkstra.dir/dijkstraVia.c.o src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra_driver.cpp.o src/dijkstra/CMakeFiles/dijkstra.dir/dijkstraVia_driver.cpp.o src/allpairs/CMakeFiles/allpairs.dir/floydWarshall.c.o src/allpairs/CMakeFiles/allpairs.dir/floydWarshall_driver.cpp.o src/allpairs/CMakeFiles/allpairs.dir/johnson.c.o src/allpairs/CMakeFiles/allpairs.dir/johnson_driver.cpp.o src/astar/CMakeFiles/astar.dir/astar.c.o src/astar/CMakeFiles/astar.dir/astar_driver.cpp.o src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_driving_distance.c.o src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_withPointsDD.c.o src/driving_distance/CMakeFiles/driving_distance.dir/drivedist_driver.cpp.o src/driving_distance/CMakeFiles/driving_distance.dir/withPoints_dd_driver.cpp.o src/ksp/CMakeFiles/ksp.dir/ksp.c.o src/ksp/CMakeFiles/ksp.dir/ksp_driver.cpp.o src/ksp/CMakeFiles/ksp.dir/withPoints_ksp.c.o src/ksp/CMakeFiles/ksp.dir/withPoints_ksp_driver.cpp.o src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath.c.o src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath_driver.cpp.o src/tsp/CMakeFiles/tsp.dir/euclideanTSP.c.o src/tsp/CMakeFiles/tsp.dir/TSP.c.o src/tsp/CMakeFiles/tsp.dir/tsp.cpp.o src/tsp/CMakeFiles/tsp.dir/TSP_driver.cpp.o src/tsp/CMakeFiles/tsp.dir/euclideanTSP_driver.cpp.o src/alpha_shape/CMakeFiles/alpha_shape.dir/pgr_alphaShape.cpp.o src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape.c.o src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape_driver.cpp.o src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar.c.o src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar_driver.cpp.o src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra.c.o src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra_driver.cpp.o src/trsp/CMakeFiles/trsp.dir/trsp.c.o src/trsp/CMakeFiles/trsp.dir/trsp_core.cpp.o src/trsp/CMakeFiles/trsp.dir/GraphDefinition.cpp.o src/trsp/CMakeFiles/trsp.dir/new_trsp.c.o src/trsp/CMakeFiles/trsp.dir/edgeInfo.cpp.o src/trsp/CMakeFiles/trsp.dir/pgr_trspHandler.cpp.o src/trsp/CMakeFiles/trsp.dir/trsp_driver.cpp.o src/trsp/CMakeFiles/trsp.dir/trsp_withPoints.c.o src/trsp/CMakeFiles/trsp.dir/trsp_withPoints_driver.cpp.o src/trsp/CMakeFiles/trsp.dir/trspVia.c.o src/trsp/CMakeFiles/trsp.dir/trspVia_driver.cpp.o src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints.c.o src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints_driver.cpp.o src/max_flow/CMakeFiles/max_flow.dir/max_flow.c.o src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow.c.o src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching.c.o src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths.c.o src/max_flow/CMakeFiles/max_flow.dir/max_flow_driver.cpp.o src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching_driver.cpp.o src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths_driver.cpp.o src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow_driver.cpp.o src/max_flow/CMakeFiles/max_flow.dir/pgr_maxflow.cpp.o src/max_flow/CMakeFiles/max_flow.dir/pgr_flowgraph.cpp.o src/max_flow/CMakeFiles/max_flow.dir/pgr_minCostMaxFlow.cpp.o src/contraction/CMakeFiles/contraction.dir/contractGraph.c.o src/contraction/CMakeFiles/contraction.dir/contractGraph_driver.cpp.o src/contraction/CMakeFiles/contraction.dir/pgr_contract.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_orders.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/fleet.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/pgr_pickDeliver.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/dnode.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_pickDeliver.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/solution.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/optimize.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/tw_node.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_node.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/order.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/initial_solution.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean_driver.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver_driver.cpp.o src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean.c.o src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver.c.o src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_problem.cpp.o src/withPoints/CMakeFiles/withPoints.dir/withPoints.c.o src/withPoints/CMakeFiles/withPoints.dir/get_new_queries.cpp.o src/withPoints/CMakeFiles/withPoints.dir/withPoints_driver.cpp.o src/withPoints/CMakeFiles/withPoints.dir/pgr_withPoints.cpp.o src/withPoints/CMakeFiles/withPoints.dir/withPointsVia.c.o src/withPoints/CMakeFiles/withPoints.dir/withPointsVia_driver.cpp.o src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull.c.o src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull_driver.cpp.o src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph.c.o src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph_driver.cpp.o src/components/CMakeFiles/components.dir/connectedComponents.c.o src/components/CMakeFiles/components.dir/strongComponents.c.o src/components/CMakeFiles/components.dir/biconnectedComponents.c.o src/components/CMakeFiles/components.dir/articulationPoints.c.o src/components/CMakeFiles/components.dir/bridges.c.o src/components/CMakeFiles/components.dir/makeConnected.c.o src/components/CMakeFiles/components.dir/makeConnected_driver.cpp.o src/components/CMakeFiles/components.dir/componentsResult.cpp.o src/components/CMakeFiles/components.dir/pgr_components.cpp.o src/components/CMakeFiles/components.dir/connectedComponents_driver.cpp.o src/components/CMakeFiles/components.dir/strongComponents_driver.cpp.o src/components/CMakeFiles/components.dir/biconnectedComponents_driver.cpp.o src/components/CMakeFiles/components.dir/articulationPoints_driver.cpp.o src/components/CMakeFiles/components.dir/bridges_driver.cpp.o src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford.c.o src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford_driver.cpp.o src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore.c.o src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore_driver.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/Dmatrix.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/compPaths.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/rule.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/bpoint.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/pgr_messages.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/combinations.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/get_check_data.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/pgdata_fetchers.cpp.o src/cpp_common/CMakeFiles/cpp_common.dir/pgdata_getters.cpp.o src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath.c.o src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath_driver.cpp.o src/chinese/CMakeFiles/chinese.dir/chinesePostman.c.o src/chinese/CMakeFiles/chinese.dir/chinesePostman_driver.cpp.o src/spanningTree/CMakeFiles/spanningTree.dir/mst_common.cpp.o src/spanningTree/CMakeFiles/spanningTree.dir/details.cpp.o src/spanningTree/CMakeFiles/spanningTree.dir/kruskal.c.o src/spanningTree/CMakeFiles/spanningTree.dir/kruskal_driver.cpp.o src/spanningTree/CMakeFiles/spanningTree.dir/prim.c.o src/spanningTree/CMakeFiles/spanningTree.dir/prim_driver.cpp.o src/mincut/CMakeFiles/mincut.dir/stoerWagner.c.o src/mincut/CMakeFiles/mincut.dir/stoerWagner_driver.cpp.o src/version/CMakeFiles/version.dir/version.c.o src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort.c.o src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort_driver.cpp.o src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure.c.o src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure_driver.cpp.o src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch.c.o src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch_driver.cpp.o src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch.c.o src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch_driver.cpp.o src/traversal/CMakeFiles/traversal.dir/depthFirstSearch.c.o src/traversal/CMakeFiles/traversal.dir/depthFirstSearch_driver.cpp.o src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring.c.o src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring_driver.cpp.o src/coloring/CMakeFiles/coloring.dir/bipartite.c.o src/coloring/CMakeFiles/coloring.dir/bipartite_driver.cpp.o src/coloring/CMakeFiles/coloring.dir/edgeColoring.c.o src/coloring/CMakeFiles/coloring.dir/edgeColoring_driver.cpp.o src/coloring/CMakeFiles/coloring.dir/pgr_edgeColoring.cpp.o src/planar/CMakeFiles/planar.dir/isPlanar.c.o src/planar/CMakeFiles/planar.dir/isPlanar_driver.cpp.o src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree.c.o src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree_driver.cpp.o src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering.c.o src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering_driver.cpp.o src/circuits/CMakeFiles/circuits.dir/hawickCircuits.c.o src/circuits/CMakeFiles/circuits.dir/hawickCircuits_driver.cpp.o
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 83%] Built target pgrouting-3.6
make -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/sql /<<PKGBUILDDIR>>/build-16/sql/CMakeFiles/extension_file.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 84%] Generating pgrouting--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-file.pl '/<<PKGBUILDDIR>>/build-16/sql/common/pgRouting-header.sql /<<PKGBUILDDIR>>/build-16/sql/common/_point_toId.sql /<<PKGBUILDDIR>>/build-16/sql/common/_startPoint.sql /<<PKGBUILDDIR>>/build-16/sql/common/_endPoint.sql /<<PKGBUILDDIR>>/build-16/sql/common/pgrouting_utilities.sql /<<PKGBUILDDIR>>/build-16/sql/common/pgr_parameter_check.sql /<<PKGBUILDDIR>>/build-16/sql/common/utilities_pgr.sql /<<PKGBUILDDIR>>/build-16/sql/common/createIndex.sql /<<PKGBUILDDIR>>/build-16/sql/common/_checkquery.sql /<<PKGBUILDDIR>>/build-16/sql/common/_checkcolumn.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/_dijkstra.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/dijkstra.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/dijkstraCost.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/dijkstraCostMatrix.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/_dijkstraVia.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/dijkstraVia.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/_dijkstraNear.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/dijkstraNear.sql /<<PKGBUILDDIR>>/build-16/sql/dijkstra/dijkstraNearCost.sql /<<PKGBUILDDIR>>/build-16/sql/allpairs/_johnson.sql /<<PKGBUILDDIR>>/build-16/sql/allpairs/johnson.sql /<<PKGBUILDDIR>>/build-16/sql/allpairs/_floydWarshall.sql /<<PKGBUILDDIR>>/build-16/sql/allpairs/floydWarshall.sql /<<PKGBUILDDIR>>/build-16/sql/astar/_astar.sql /<<PKGBUILDDIR>>/build-16/sql/astar/astar.sql /<<PKGBUILDDIR>>/build-16/sql/astar/astarCost.sql /<<PKGBUILDDIR>>/build-16/sql/astar/astarCostMatrix.sql /<<PKGBUILDDIR>>/build-16/sql/driving_distance/_withPointsDD.sql /<<PKGBUILDDIR>>/build-16/sql/driving_distance/withPointsDD.sql /<<PKGBUILDDIR>>/build-16/sql/driving_distance/_drivingDistance.sql /<<PKGBUILDDIR>>/build-16/sql/driving_distance/drivingDistance.sql /<<PKGBUILDDIR>>/build-16/sql/ksp/_ksp.sql /<<PKGBUILDDIR>>/build-16/sql/ksp/ksp.sql /<<PKGBUILDDIR>>/build-16/sql/ksp/_withPointsKSP.sql /<<PKGBUILDDIR>>/build-16/sql/ksp/withPointsKSP.sql /<<PKGBUILDDIR>>/build-16/sql/ksp/_turnRestrictedPath.sql /<<PKGBUILDDIR>>/build-16/sql/ksp/turnRestrictedPath.sql /<<PKGBUILDDIR>>/build-16/sql/tsp/_TSP.sql /<<PKGBUILDDIR>>/build-16/sql/tsp/_TSPeuclidean.sql /<<PKGBUILDDIR>>/build-16/sql/tsp/TSP.sql /<<PKGBUILDDIR>>/build-16/sql/tsp/TSPeuclidean.sql /<<PKGBUILDDIR>>/build-16/sql/alpha_shape/_alphaShape.sql /<<PKGBUILDDIR>>/build-16/sql/alpha_shape/alphaShape.sql /<<PKGBUILDDIR>>/build-16/sql/bdAstar/_bdAstar.sql /<<PKGBUILDDIR>>/build-16/sql/bdAstar/bdAstar.sql /<<PKGBUILDDIR>>/build-16/sql/bdAstar/bdAstarCost.sql /<<PKGBUILDDIR>>/build-16/sql/bdAstar/bdAstarCostMatrix.sql /<<PKGBUILDDIR>>/build-16/sql/bdDijkstra/_bdDijkstra.sql /<<PKGBUILDDIR>>/build-16/sql/bdDijkstra/bdDijkstra.sql /<<PKGBUILDDIR>>/build-16/sql/bdDijkstra/bdDijkstraCost.sql /<<PKGBUILDDIR>>/build-16/sql/bdDijkstra/bdDijkstraCostMatrix.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/_trsp.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/trsp.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/_pgr_trsp.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/_array_reverse.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/pgr_trsp.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/_pgr_trspViaVertices.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/pgr_trspViaVertices.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/pgr_trspViaEdges.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/_trsp_withPoints.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/trsp_withPoints.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/trspVia.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/_trspVia.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/trspVia_withPoints.sql /<<PKGBUILDDIR>>/build-16/sql/trsp/_trspVia_withPoints.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/_maxflow.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/_maxFlowMinCost.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/edmondsKarp.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/boykovKolmogorov.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/pushRelabel.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/_maxCardinalityMatch.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/maxCardinalityMatch.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/_edgeDisjointPaths.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/edgeDisjointPaths.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/maxFlowMinCost.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/maxFlowMinCost_Cost.sql /<<PKGBUILDDIR>>/build-16/sql/max_flow/maxFlow.sql /<<PKGBUILDDIR>>/build-16/sql/contraction/_contraction.sql /<<PKGBUILDDIR>>/build-16/sql/contraction/contraction.sql /<<PKGBUILDDIR>>/build-16/sql/pickDeliver/_pickDeliver.sql /<<PKGBUILDDIR>>/build-16/sql/pickDeliver/pickDeliver.sql /<<PKGBUILDDIR>>/build-16/sql/pickDeliver/_pickDeliverEuclidean.sql /<<PKGBUILDDIR>>/build-16/sql/pickDeliver/pickDeliverEuclidean.sql /<<PKGBUILDDIR>>/build-16/sql/vrp_basic/_pgr_vrpOneDepot.sql /<<PKGBUILDDIR>>/build-16/sql/vrp_basic/pgr_vrpOneDepot.sql /<<PKGBUILDDIR>>/build-16/sql/withPoints/_withPoints.sql /<<PKGBUILDDIR>>/build-16/sql/withPoints/withPoints.sql /<<PKGBUILDDIR>>/build-16/sql/withPoints/withPointsCost.sql /<<PKGBUILDDIR>>/build-16/sql/withPoints/withPointsCostMatrix.sql /<<PKGBUILDDIR>>/build-16/sql/withPoints/_withPointsVia.sql /<<PKGBUILDDIR>>/build-16/sql/withPoints/withPointsVia.sql /<<PKGBUILDDIR>>/build-16/sql/lineGraph/_lineGraphFull.sql /<<PKGBUILDDIR>>/build-16/sql/lineGraph/lineGraphFull.sql /<<PKGBUILDDIR>>/build-16/sql/lineGraph/_lineGraph.sql /<<PKGBUILDDIR>>/build-16/sql/lineGraph/lineGraph.sql /<<PKGBUILDDIR>>/build-16/sql/components/_connectedComponents.sql /<<PKGBUILDDIR>>/build-16/sql/components/connectedComponents.sql /<<PKGBUILDDIR>>/build-16/sql/components/_strongComponents.sql /<<PKGBUILDDIR>>/build-16/sql/components/strongComponents.sql /<<PKGBUILDDIR>>/build-16/sql/components/_biconnectedComponents.sql /<<PKGBUILDDIR>>/build-16/sql/components/biconnectedComponents.sql /<<PKGBUILDDIR>>/build-16/sql/components/_articulationPoints.sql /<<PKGBUILDDIR>>/build-16/sql/components/articulationPoints.sql /<<PKGBUILDDIR>>/build-16/sql/components/_bridges.sql /<<PKGBUILDDIR>>/build-16/sql/components/bridges.sql /<<PKGBUILDDIR>>/build-16/sql/components/_makeConnected.sql /<<PKGBUILDDIR>>/build-16/sql/components/makeConnected.sql /<<PKGBUILDDIR>>/build-16/sql/bellman_ford/_bellman_ford.sql /<<PKGBUILDDIR>>/build-16/sql/bellman_ford/bellman_ford.sql /<<PKGBUILDDIR>>/build-16/sql/bellman_ford/_edwardMoore.sql /<<PKGBUILDDIR>>/build-16/sql/bellman_ford/edwardMoore.sql /<<PKGBUILDDIR>>/build-16/sql/dagShortestPath/_dagShortestPath.sql /<<PKGBUILDDIR>>/build-16/sql/dagShortestPath/dagShortestPath.sql /<<PKGBUILDDIR>>/build-16/sql/chinese/_pgr_chinesePostman.sql /<<PKGBUILDDIR>>/build-16/sql/chinese/pgr_chinesePostman.sql /<<PKGBUILDDIR>>/build-16/sql/chinese/pgr_chinesePostmanCost.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/_prim.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/_kruskal.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/prim.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/primDFS.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/primBFS.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/primDD.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/kruskal.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/kruskalDFS.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/kruskalBFS.sql /<<PKGBUILDDIR>>/build-16/sql/spanningTree/kruskalDD.sql /<<PKGBUILDDIR>>/build-16/sql/mincut/_stoerWagner.sql /<<PKGBUILDDIR>>/build-16/sql/mincut/stoerWagner.sql /<<PKGBUILDDIR>>/build-16/sql/version/_version.sql /<<PKGBUILDDIR>>/build-16/sql/version/version.sql /<<PKGBUILDDIR>>/build-16/sql/version/full_version.sql /<<PKGBUILDDIR>>/build-16/sql/topologicalSort/_topologicalSort.sql /<<PKGBUILDDIR>>/build-16/sql/topologicalSort/topologicalSort.sql /<<PKGBUILDDIR>>/build-16/sql/transitiveClosure/_transitiveClosure.sql /<<PKGBUILDDIR>>/build-16/sql/transitiveClosure/transitiveClosure.sql /<<PKGBUILDDIR>>/build-16/sql/breadthFirstSearch/_breadthFirstSearch.sql /<<PKGBUILDDIR>>/build-16/sql/breadthFirstSearch/_binaryBreadthFirstSearch.sql /<<PKGBUILDDIR>>/build-16/sql/breadthFirstSearch/breadthFirstSearch.sql /<<PKGBUILDDIR>>/build-16/sql/breadthFirstSearch/binaryBreadthFirstSearch.sql /<<PKGBUILDDIR>>/build-16/sql/traversal/_depthFirstSearch.sql /<<PKGBUILDDIR>>/build-16/sql/traversal/depthFirstSearch.sql /<<PKGBUILDDIR>>/build-16/sql/coloring/_sequentialVertexColoring.sql /<<PKGBUILDDIR>>/build-16/sql/coloring/sequentialVertexColoring.sql /<<PKGBUILDDIR>>/build-16/sql/coloring/_bipartite.sql /<<PKGBUILDDIR>>/build-16/sql/coloring/bipartite.sql /<<PKGBUILDDIR>>/build-16/sql/coloring/_edgeColoring.sql /<<PKGBUILDDIR>>/build-16/sql/coloring/edgeColoring.sql /<<PKGBUILDDIR>>/build-16/sql/planar/_isPlanar.sql /<<PKGBUILDDIR>>/build-16/sql/planar/isPlanar.sql /<<PKGBUILDDIR>>/build-16/sql/dominator/_lengauerTarjanDominatorTree.sql /<<PKGBUILDDIR>>/build-16/sql/dominator/lengauerTarjanDominatorTree.sql /<<PKGBUILDDIR>>/build-16/sql/ordering/_cuthillMckeeOrdering.sql /<<PKGBUILDDIR>>/build-16/sql/ordering/cuthillMckeeOrdering.sql /<<PKGBUILDDIR>>/build-16/sql/circuits/_hawickCircuits.sql /<<PKGBUILDDIR>>/build-16/sql/circuits/hawickCircuits.sql /<<PKGBUILDDIR>>/build-16/sql/topology/createtopology.sql /<<PKGBUILDDIR>>/build-16/sql/topology/analyzegraph.sql /<<PKGBUILDDIR>>/build-16/sql/topology/analyzeOneway.sql /<<PKGBUILDDIR>>/build-16/sql/topology/createverticestable.sql /<<PKGBUILDDIR>>/build-16/sql/topology/nodeNetwork.sql /<<PKGBUILDDIR>>/build-16/sql/topology/extractVertices.sql /<<PKGBUILDDIR>>/build-16/sql/topology/degree.sql /<<PKGBUILDDIR>>/build-16/sql/utilities/findCloseEdges.sql'
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 84%] Built target extension_file
make -f sql/CMakeFiles/update_files.dir/build.make sql/CMakeFiles/update_files.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/sql /<<PKGBUILDDIR>>/build-16/sql/CMakeFiles/update_files.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f sql/CMakeFiles/update_files.dir/build.make sql/CMakeFiles/update_files.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
[ 84%] Generating pgrouting--3.5.1--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.5.1 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 85%] Generating pgrouting--3.5.0--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.5.0 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 85%] Generating pgrouting--3.4.2--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.4.2 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 86%] Generating pgrouting--3.4.1--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.4.1 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 86%] Generating pgrouting--3.4.0--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.4.0 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 87%] Generating pgrouting--3.3.5--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.3.5 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 87%] Generating pgrouting--3.3.4--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.3.4 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 88%] Generating pgrouting--3.3.3--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.3.3 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 88%] Generating pgrouting--3.3.2--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.3.2 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 89%] Generating pgrouting--3.3.1--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.3.1 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 89%] Generating pgrouting--3.3.0--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.3.0 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 90%] Generating pgrouting--3.2.2--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.2.2 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 90%] Generating pgrouting--3.2.1--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.2.1 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 91%] Generating pgrouting--3.2.0--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.2.0 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 91%] Generating pgrouting--3.1.4--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.1.4 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 92%] Generating pgrouting--3.1.3--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.1.3 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 92%] Generating pgrouting--3.1.2--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.1.2 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 93%] Generating pgrouting--3.1.1--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.1.1 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 93%] Generating pgrouting--3.1.0--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.1.0 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 94%] Generating pgrouting--3.0.6--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.0.6 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 94%] Generating pgrouting--3.0.5--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.0.5 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 95%] Generating pgrouting--3.0.4--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.0.4 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 95%] Generating pgrouting--3.0.3--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.0.3 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 96%] Generating pgrouting--3.0.2--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.0.2 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 96%] Generating pgrouting--3.0.1--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.0.1 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 97%] Generating pgrouting--3.0.0--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 3.0.0 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 97%] Generating pgrouting--2.6.3--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 2.6.3 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 98%] Generating pgrouting--2.6.2--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 2.6.2 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 98%] Generating pgrouting--2.6.1--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 2.6.1 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
[ 99%] Generating pgrouting--2.6.0--3.6.0.sql
cd /<<PKGBUILDDIR>>/build-16/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.6.0 2.6.0 /<<PKGBUILDDIR>>/build-16/sql/sigs /<<PKGBUILDDIR>>/build-16/sql
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[100%] Built target update_files
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-16/CMakeFiles 0
make[2]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
### End 16 build ###
set -e; \
for v in $(pg_buildext supported-versions); do \
make -C build-$v doc; \
rm build-$v/doc/html/en/_static/images/pgrouting.png; \
ln -s ../pgrouting.png build-$v/doc/html/en/_static/images/pgrouting.png; \
rm build-$v/doc/html/en/_static/images/ccbysa.png; \
ln -s ../../_images/ccbysa.png build-$v/doc/html/en/_static/images/ccbysa.png; \
ln -s /usr/share/javascript/mathjax build-$v/doc/html/en/_static/mathjax; \
done
supported-versions: WARNING! Unknown distribution ID in /etc/os-release: raspbian
debian found in ID_LIKE, treating as Debian
make[2]: Entering directory '/<<PKGBUILDDIR>>/build-16'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-16 --check-build-system CMakeFiles/Makefile.cmake 0
make -f CMakeFiles/Makefile2 doc
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-16'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-16 --check-build-system CMakeFiles/Makefile.cmake 0
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-16/CMakeFiles 0
make -f CMakeFiles/Makefile2 doc/CMakeFiles/doc.dir/all
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make -f doc/CMakeFiles/html-en.dir/build.make doc/CMakeFiles/html-en.dir/depend
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/doc /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/doc /<<PKGBUILDDIR>>/build-16/doc/CMakeFiles/html-en.dir/DependInfo.cmake "--color="
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f doc/CMakeFiles/html-en.dir/build.make doc/CMakeFiles/html-en.dir/build
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-16'
Generating html/en documentation ...
cd /<<PKGBUILDDIR>>/build-16/doc && /usr/bin/sphinx-build -v -W --keep-going -j auto -b html -D language='en' -c /<<PKGBUILDDIR>>/build-16/doc /<<PKGBUILDDIR>>/build-16/doc /<<PKGBUILDDIR>>/build-16/doc/html/en
Running Sphinx v7.2.6
making output directory... done
building [mo]: targets for 2 po files that are out of date
writing output... [ 50%] ../../locale/en/LC_MESSAGES/index.mo
writing output... [100%] ../../locale/en/LC_MESSAGES/pgrouting_doc_strings.mo
building [html]: targets for 130 source files that are out of date
updating environment: [new config] 130 added, 0 changed, 0 removed
reading sources... [ 12%] BFS-category .. drivingDistance-category
reading sources... [ 25%] experimental .. pgr_analyzeOneWay
reading sources... [ 38%] pgr_articulationPoints .. pgr_contraction
reading sources... [ 50%] pgr_createTopology .. pgr_extractVertices
reading sources... [ 62%] pgr_findCloseEdges .. pgr_maxFlowMinCost_Cost
reading sources... [ 75%] pgr_nodeNetwork .. pgr_turnRestrictedPath
reading sources... [ 88%] pgr_version .. transformation-family
reading sources... [100%] traversal-family .. withPoints-family
looking for now-outdated files... none found
pickling environment... done
checking consistency... done
preparing documents... done
copying assets... copying static files... done
copying extra files... done
done
writing output... [ 14%] DFS-category .. index
writing output... [ 29%] kruskal-family .. pgr_bdDijkstra
writing output... [ 43%] pgr_bdDijkstraCost .. pgr_dijkstra
writing output... [ 57%] pgr_dijkstraCost .. pgr_kruskalDD
writing output... [ 71%] pgr_kruskalDFS .. pgr_strongComponents
writing output... [ 86%] pgr_topologicalSort .. routingFunctions
writing output... [100%] sampledata .. withPoints-family
generating indices... genindex done
writing additional pages... search done
copying images... [ 3%] images/restrictions.png
copying images... [ 6%] images/with_restrictions.png
copying images... [ 9%] images/Fig6-undirected.png
copying images... [ 12%] images/undirected_sampledata_b.png
copying images... [ 15%] images/undirected_sampledata_c.png
copying images... [ 18%] images/newgraph.png
copying images... [ 21%] _static/images/ccbysa.png
copying images... [ 24%] images/boost-inside.jpeg
copying images... [ 27%] images/Dijkstra_Animation.gif
copying images... [ 30%] images/crossing_edges.png
copying images... [ 33%] images/wi29optimal.png
copying images... [ 36%] images/wi29Solution.png
copying images... [ 39%] images/ap_sampledata.png
copying images... [ 42%] images/bcc_sampledata.png
copying images... [ 45%] images/bipartite.png
copying images... [ 48%] images/bfs-ascending.png
copying images... [ 52%] images/bfs-descending.png
copying images... [ 55%] images/bridge_sampledata.png
copying images... [ 58%] images/cc_sampledata.png
copying images... [ 61%] images/Fig1-originalData.png
copying images... [ 64%] images/Fig1-AscendingOrder.png
copying images... [ 67%] images/Fig2-DescendingOrder.png
copying images... [ 70%] images/Fig2-cost.png
copying images... [ 73%] images/Fig4-costUndirected.png
copying images... [ 76%] images/nonPlanar.png
copying images... [ 79%] images/original.png
copying images... [ 82%] images/transformation.png
copying images... [ 85%] images/before_node_net.png
copying images... [ 88%] images/after_node_net.png
copying images... [ 91%] images/scc_sampledata.png
copying images... [ 94%] images/rightDrivingSide.png
copying images... [ 97%] images/leftDrivingSide.png
copying images... [100%] images/noMatterDrivingSide.png
dumping search index in English (code: en)... done
dumping object inventory... done
build succeeded.
The HTML pages are in html/en.
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
Built target html-en
make -f doc/CMakeFiles/html.dir/build.make doc/CMakeFiles/html.dir/depend
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/doc /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/doc /<<PKGBUILDDIR>>/build-16/doc/CMakeFiles/html.dir/DependInfo.cmake "--color="
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f doc/CMakeFiles/html.dir/build.make doc/CMakeFiles/html.dir/build
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[5]: Nothing to be done for 'doc/CMakeFiles/html.dir/build'.
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
Built target html
make -f doc/CMakeFiles/doc.dir/build.make doc/CMakeFiles/doc.dir/depend
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/doc /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/doc /<<PKGBUILDDIR>>/build-16/doc/CMakeFiles/doc.dir/DependInfo.cmake "--color="
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f doc/CMakeFiles/doc.dir/build.make doc/CMakeFiles/doc.dir/build
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[5]: Nothing to be done for 'doc/CMakeFiles/doc.dir/build'.
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
Built target doc
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-16/CMakeFiles 0
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make[2]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
create-stamp debian/debhelper-build-stamp
dh_prep -a
debian/rules override_dh_auto_install
make[1]: Entering directory '/<<PKGBUILDDIR>>'
pg_buildext install build-%v postgresql-%v-pgrouting
supported-versions: WARNING! Unknown distribution ID in /etc/os-release: raspbian
debian found in ID_LIKE, treating as Debian
### PostgreSQL 16 install ###
make[2]: Entering directory '/<<PKGBUILDDIR>>/build-16'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-16 --check-build-system CMakeFiles/Makefile.cmake 0
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-16/CMakeFiles /<<PKGBUILDDIR>>/build-16//CMakeFiles/progress.marks
make -f CMakeFiles/Makefile2 all
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/circuits /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/circuits /<<PKGBUILDDIR>>/build-16/src/circuits/CMakeFiles/circuits.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/circuits/CMakeFiles/circuits.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 1%] Built target circuits
make -f src/dijkstra/CMakeFiles/dijkstra.dir/build.make src/dijkstra/CMakeFiles/dijkstra.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dijkstra /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/dijkstra /<<PKGBUILDDIR>>/build-16/src/dijkstra/CMakeFiles/dijkstra.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/dijkstra/CMakeFiles/dijkstra.dir/build.make src/dijkstra/CMakeFiles/dijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/dijkstra/CMakeFiles/dijkstra.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 3%] Built target dijkstra
make -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/common /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/common /<<PKGBUILDDIR>>/build-16/src/common/CMakeFiles/common.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/common/CMakeFiles/common.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 9%] Built target common
make -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/allpairs /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/allpairs /<<PKGBUILDDIR>>/build-16/src/allpairs/CMakeFiles/allpairs.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/allpairs/CMakeFiles/allpairs.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 11%] Built target allpairs
make -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/astar /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/astar /<<PKGBUILDDIR>>/build-16/src/astar/CMakeFiles/astar.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/astar/CMakeFiles/astar.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 12%] Built target astar
make -f src/driving_distance/CMakeFiles/driving_distance.dir/build.make src/driving_distance/CMakeFiles/driving_distance.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/driving_distance /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/driving_distance /<<PKGBUILDDIR>>/build-16/src/driving_distance/CMakeFiles/driving_distance.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/driving_distance/CMakeFiles/driving_distance.dir/build.make src/driving_distance/CMakeFiles/driving_distance.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/driving_distance/CMakeFiles/driving_distance.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 14%] Built target driving_distance
make -f src/ksp/CMakeFiles/ksp.dir/build.make src/ksp/CMakeFiles/ksp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ksp /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/ksp /<<PKGBUILDDIR>>/build-16/src/ksp/CMakeFiles/ksp.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/ksp/CMakeFiles/ksp.dir/build.make src/ksp/CMakeFiles/ksp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/ksp/CMakeFiles/ksp.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 17%] Built target ksp
make -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/tsp /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/tsp /<<PKGBUILDDIR>>/build-16/src/tsp/CMakeFiles/tsp.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/tsp/CMakeFiles/tsp.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 19%] Built target tsp
make -f src/alpha_shape/CMakeFiles/alpha_shape.dir/build.make src/alpha_shape/CMakeFiles/alpha_shape.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/alpha_shape /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/alpha_shape /<<PKGBUILDDIR>>/build-16/src/alpha_shape/CMakeFiles/alpha_shape.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/alpha_shape/CMakeFiles/alpha_shape.dir/build.make src/alpha_shape/CMakeFiles/alpha_shape.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/alpha_shape/CMakeFiles/alpha_shape.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 20%] Built target alpha_shape
make -f src/bdAstar/CMakeFiles/bdAstar.dir/build.make src/bdAstar/CMakeFiles/bdAstar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdAstar /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/bdAstar /<<PKGBUILDDIR>>/build-16/src/bdAstar/CMakeFiles/bdAstar.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/bdAstar/CMakeFiles/bdAstar.dir/build.make src/bdAstar/CMakeFiles/bdAstar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/bdAstar/CMakeFiles/bdAstar.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 21%] Built target bdAstar
make -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdDijkstra /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/bdDijkstra /<<PKGBUILDDIR>>/build-16/src/bdDijkstra/CMakeFiles/bdDijkstra.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 22%] Built target bdDijkstra
make -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/trsp /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/trsp /<<PKGBUILDDIR>>/build-16/src/trsp/CMakeFiles/trsp.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/trsp/CMakeFiles/trsp.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 29%] Built target trsp
make -f src/max_flow/CMakeFiles/max_flow.dir/build.make src/max_flow/CMakeFiles/max_flow.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/max_flow /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/max_flow /<<PKGBUILDDIR>>/build-16/src/max_flow/CMakeFiles/max_flow.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/max_flow/CMakeFiles/max_flow.dir/build.make src/max_flow/CMakeFiles/max_flow.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/max_flow/CMakeFiles/max_flow.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 35%] Built target max_flow
make -f src/contraction/CMakeFiles/contraction.dir/build.make src/contraction/CMakeFiles/contraction.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/contraction /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/contraction /<<PKGBUILDDIR>>/build-16/src/contraction/CMakeFiles/contraction.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/contraction/CMakeFiles/contraction.dir/build.make src/contraction/CMakeFiles/contraction.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/contraction/CMakeFiles/contraction.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 37%] Built target contraction
make -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/pickDeliver /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/pickDeliver /<<PKGBUILDDIR>>/build-16/src/pickDeliver/CMakeFiles/pickDeliver.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/pickDeliver/CMakeFiles/pickDeliver.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 45%] Built target pickDeliver
make -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/withPoints /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/withPoints /<<PKGBUILDDIR>>/build-16/src/withPoints/CMakeFiles/withPoints.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/withPoints/CMakeFiles/withPoints.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 49%] Built target withPoints
make -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/lineGraph /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/lineGraph /<<PKGBUILDDIR>>/build-16/src/lineGraph/CMakeFiles/lineGraph.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/lineGraph/CMakeFiles/lineGraph.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 51%] Built target lineGraph
make -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/components /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/components /<<PKGBUILDDIR>>/build-16/src/components/CMakeFiles/components.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/components/CMakeFiles/components.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 58%] Built target components
make -f src/bellman_ford/CMakeFiles/bellman_ford.dir/build.make src/bellman_ford/CMakeFiles/bellman_ford.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bellman_ford /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/bellman_ford /<<PKGBUILDDIR>>/build-16/src/bellman_ford/CMakeFiles/bellman_ford.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/bellman_ford/CMakeFiles/bellman_ford.dir/build.make src/bellman_ford/CMakeFiles/bellman_ford.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/bellman_ford/CMakeFiles/bellman_ford.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 60%] Built target bellman_ford
make -f src/cpp_common/CMakeFiles/cpp_common.dir/build.make src/cpp_common/CMakeFiles/cpp_common.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/cpp_common /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/cpp_common /<<PKGBUILDDIR>>/build-16/src/cpp_common/CMakeFiles/cpp_common.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/cpp_common/CMakeFiles/cpp_common.dir/build.make src/cpp_common/CMakeFiles/cpp_common.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/cpp_common/CMakeFiles/cpp_common.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 64%] Built target cpp_common
make -f src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build.make src/dagShortestPath/CMakeFiles/dagShortestPath.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dagShortestPath /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/dagShortestPath /<<PKGBUILDDIR>>/build-16/src/dagShortestPath/CMakeFiles/dagShortestPath.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build.make src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 65%] Built target dagShortestPath
make -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/chinese /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/chinese /<<PKGBUILDDIR>>/build-16/src/chinese/CMakeFiles/chinese.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/chinese/CMakeFiles/chinese.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 66%] Built target chinese
make -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/spanningTree /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/spanningTree /<<PKGBUILDDIR>>/build-16/src/spanningTree/CMakeFiles/spanningTree.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/spanningTree/CMakeFiles/spanningTree.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 69%] Built target spanningTree
make -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mincut /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/mincut /<<PKGBUILDDIR>>/build-16/src/mincut/CMakeFiles/mincut.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/mincut/CMakeFiles/mincut.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 70%] Built target mincut
make -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/version /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/version /<<PKGBUILDDIR>>/build-16/src/version/CMakeFiles/version.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/version/CMakeFiles/version.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 70%] Built target version
make -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/topologicalSort /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/topologicalSort /<<PKGBUILDDIR>>/build-16/src/topologicalSort/CMakeFiles/topologicalSort.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/topologicalSort/CMakeFiles/topologicalSort.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 71%] Built target topologicalSort
make -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/transitiveClosure /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/transitiveClosure /<<PKGBUILDDIR>>/build-16/src/transitiveClosure/CMakeFiles/transitiveClosure.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 72%] Built target transitiveClosure
make -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-16/src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 74%] Built target breadthFirstSearch
make -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/traversal /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/traversal /<<PKGBUILDDIR>>/build-16/src/traversal/CMakeFiles/traversal.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/traversal/CMakeFiles/traversal.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 75%] Built target traversal
make -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/coloring /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/coloring /<<PKGBUILDDIR>>/build-16/src/coloring/CMakeFiles/coloring.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/coloring/CMakeFiles/coloring.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 79%] Built target coloring
make -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/planar /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/planar /<<PKGBUILDDIR>>/build-16/src/planar/CMakeFiles/planar.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/planar/CMakeFiles/planar.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 80%] Built target planar
make -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dominator /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/dominator /<<PKGBUILDDIR>>/build-16/src/dominator/CMakeFiles/dominator.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/dominator/CMakeFiles/dominator.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 81%] Built target dominator
make -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ordering /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/src/ordering /<<PKGBUILDDIR>>/build-16/src/ordering/CMakeFiles/ordering.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'src/ordering/CMakeFiles/ordering.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 82%] Built target ordering
make -f CMakeFiles/pgrouting-3.6.dir/build.make CMakeFiles/pgrouting-3.6.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/CMakeFiles/pgrouting-3.6.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f CMakeFiles/pgrouting-3.6.dir/build.make CMakeFiles/pgrouting-3.6.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'CMakeFiles/pgrouting-3.6.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 83%] Built target pgrouting-3.6
make -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/sql /<<PKGBUILDDIR>>/build-16/sql/CMakeFiles/extension_file.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'sql/CMakeFiles/extension_file.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[ 84%] Built target extension_file
make -f sql/CMakeFiles/update_files.dir/build.make sql/CMakeFiles/update_files.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
cd /<<PKGBUILDDIR>>/build-16 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-16 /<<PKGBUILDDIR>>/build-16/sql /<<PKGBUILDDIR>>/build-16/sql/CMakeFiles/update_files.dir/DependInfo.cmake "--color="
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
make -f sql/CMakeFiles/update_files.dir/build.make sql/CMakeFiles/update_files.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[4]: Nothing to be done for 'sql/CMakeFiles/update_files.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
[100%] Built target update_files
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-16/CMakeFiles 0
make -f CMakeFiles/Makefile2 preinstall
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-16'
make[3]: Nothing to be done for 'preinstall'.
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
Install the project...
/usr/bin/cmake -P cmake_install.cmake
-- Install configuration: "Release"
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/lib/postgresql/16/lib/libpgrouting-3.6.so
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.5.1--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.5.0--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.4.2--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.4.1--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.4.0--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.3.5--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.3.4--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.3.3--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.3.2--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.3.1--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.3.0--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.2.2--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.2.1--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.2.0--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.1.4--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.1.3--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.1.2--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.1.1--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.1.0--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.0.6--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.0.5--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.0.4--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.0.3--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.0.2--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.0.1--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.0.0--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--2.6.3--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--2.6.2--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--2.6.1--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--2.6.0--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting--3.6.0.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-16-pgrouting/usr/share/postgresql/16/extension/pgrouting.control
make[2]: Leaving directory '/<<PKGBUILDDIR>>/build-16'
### End 16 install ###
set -e; \
for v in $(pg_buildext supported-versions); do \
mkdir -p debian/postgresql-$v-pgrouting-doc/usr/share/doc/postgresql-$v-pgrouting-doc; \
cp -r build-$v/doc/html debian/postgresql-$v-pgrouting-doc/usr/share/doc/postgresql-$v-pgrouting-doc; \
mkdir -p debian/postgresql-$v-pgrouting-doc/usr/share/doc-base; \
sed "s,PGVERSION,$v,g" < debian/postgresql-pgrouting-doc.doc-base.in > debian/postgresql-$v-pgrouting-doc/usr/share/doc-base/postgresql-$v-pgrouting-doc; \
mkdir -p debian/postgresql-$v-pgrouting-scripts/usr; \
mv debian/postgresql-$v-pgrouting/usr/share debian/postgresql-$v-pgrouting-scripts/usr; \
rdfind -makeresultsfile false -makehardlinks true \
debian/postgresql-$v-pgrouting-scripts/usr/share/postgresql/*/extension; \
done
supported-versions: WARNING! Unknown distribution ID in /etc/os-release: raspbian
debian found in ID_LIKE, treating as Debian
Now scanning "debian/postgresql-16-pgrouting-scripts/usr/share/postgresql/16/extension", found 32 files.
Now have 32 files in total.
Removed 0 files due to nonunique device and inode.
Total size is 12148560 bytes or 12 MiB
Removed 3 files due to unique sizes from list. 29 files left.
Now eliminating candidates based on first bytes: removed 0 files from list. 29 files left.
Now eliminating candidates based on last bytes: removed 0 files from list. 29 files left.
Now eliminating candidates based on sha1 checksum: removed 0 files from list. 29 files left.
It seems like you have 29 files that are not unique
Totally, 9 MiB can be reduced.
Now making hard links.
Making 23 links.
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
dh_installdocs -a
debian/rules override_dh_installchangelogs
make[1]: Entering directory '/<<PKGBUILDDIR>>'
dh_installchangelogs doc/src/release_notes.rst
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
dh_perl -a
dh_link -a
dh_strip_nondeterminism -a
dh_compress -a
dh_fixperms -a
dh_missing -a
dh_dwz -a
dh_strip -a
debian/rules override_dh_makeshlibs
make[1]: Entering directory '/<<PKGBUILDDIR>>'
dh_makeshlibs -Xusr/lib/postgresql
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
dh_shlibdeps -a
dpkg-shlibdeps: warning: debian/postgresql-16-pgrouting/usr/lib/postgresql/16/lib/libpgrouting-3.6.so contains an unresolvable reference to symbol SPI_prepare: it's probably a plugin
dpkg-shlibdeps: warning: 46 other similar warnings have been skipped (use -v to see them all)
dh_installdeb -a
dh_gencontrol -a
dh_md5sums -a
dh_builddeb -a
dpkg-deb: building package 'postgresql-pgrouting' in '../postgresql-pgrouting_3.6.0-2_armhf.deb'.
dpkg-deb: building package 'postgresql-16-pgrouting-dbgsym' in '../postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb'.
dpkg-deb: building package 'postgresql-16-pgrouting' in '../postgresql-16-pgrouting_3.6.0-2_armhf.deb'.
dpkg-genbuildinfo --build=any -O../pgrouting_3.6.0-2_armhf.buildinfo
dpkg-genchanges --build=any -mRaspbian pi5 test autobuilder <root@raspbian.org> -O../pgrouting_3.6.0-2_armhf.changes
dpkg-genchanges: info: binary-only arch-specific upload (source code and arch-indep packages not included)
dpkg-source --after-build .
dpkg-buildpackage: info: binary-only upload (no source included)
--------------------------------------------------------------------------------
Build finished at 2023-11-28T05:58:57Z
Finished
--------
I: Built successfully
+------------------------------------------------------------------------------+
| Changes |
+------------------------------------------------------------------------------+
pgrouting_3.6.0-2_armhf.changes:
--------------------------------
Format: 1.8
Date: Sun, 26 Nov 2023 09:25:19 +0100
Source: pgrouting
Binary: postgresql-16-pgrouting postgresql-16-pgrouting-dbgsym postgresql-pgrouting
Architecture: armhf
Version: 3.6.0-2
Distribution: trixie-staging
Urgency: medium
Maintainer: Raspbian pi5 test autobuilder <root@raspbian.org>
Changed-By: Bas Couwenberg <sebastic@debian.org>
Description:
postgresql-16-pgrouting - Routing functionality support for PostgreSQL/PostGIS
postgresql-pgrouting - Routing functionality support for PostgreSQL/PostGIS - Metapackag
Closes: 1056730
Changes:
pgrouting (3.6.0-2) unstable; urgency=medium
.
* Team upload.
* Add upstream patch to fix FTBFS with 32bit architectures.
(closes: #1056730)
Checksums-Sha1:
5e4ed9e576c18b66ace071b87ec0159c08c4e474 12755 pgrouting_3.6.0-2_armhf.buildinfo
dd0c8bf36cacefe00defcb4faeb2caf3f1735bbf 24617516 postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb
614c580da41422c3b46f74d616c2e96d2efceb8a 728456 postgresql-16-pgrouting_3.6.0-2_armhf.deb
3977bb5f31a4c3820ca3499f7f91a860cef8fd95 21444 postgresql-pgrouting_3.6.0-2_armhf.deb
Checksums-Sha256:
f6a3fa2d27aa7b39adfe8b39293b00004926f11d671e9f7b34aa98f1aea24613 12755 pgrouting_3.6.0-2_armhf.buildinfo
a651dbb3939e43ed2332e1383386b7a38a2bb408492a918eef34d81803e44a10 24617516 postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb
45d936e3d99d8326d6c16484666267a043fc9364c0cbc4e17fe342a18959daa8 728456 postgresql-16-pgrouting_3.6.0-2_armhf.deb
f603dcb8d94794e3b4275bd7bf9b62f51b9434a7a0d1b24227c56b5db00f6604 21444 postgresql-pgrouting_3.6.0-2_armhf.deb
Files:
17e7a7f9ae2278a832512f6e33364fda 12755 misc optional pgrouting_3.6.0-2_armhf.buildinfo
0a87c269c32a0ce8465f2bc0fe1144b5 24617516 debug optional postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb
2b2d8aaae8f5c08d360c92bcdf94cd93 728456 misc optional postgresql-16-pgrouting_3.6.0-2_armhf.deb
5e831e65c6e39a5a34fe3ba0efc99af6 21444 metapackages optional postgresql-pgrouting_3.6.0-2_armhf.deb
+------------------------------------------------------------------------------+
| Buildinfo |
+------------------------------------------------------------------------------+
Format: 1.0
Source: pgrouting
Binary: postgresql-16-pgrouting postgresql-16-pgrouting-dbgsym postgresql-pgrouting
Architecture: armhf
Version: 3.6.0-2
Checksums-Md5:
0a87c269c32a0ce8465f2bc0fe1144b5 24617516 postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb
2b2d8aaae8f5c08d360c92bcdf94cd93 728456 postgresql-16-pgrouting_3.6.0-2_armhf.deb
5e831e65c6e39a5a34fe3ba0efc99af6 21444 postgresql-pgrouting_3.6.0-2_armhf.deb
Checksums-Sha1:
dd0c8bf36cacefe00defcb4faeb2caf3f1735bbf 24617516 postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb
614c580da41422c3b46f74d616c2e96d2efceb8a 728456 postgresql-16-pgrouting_3.6.0-2_armhf.deb
3977bb5f31a4c3820ca3499f7f91a860cef8fd95 21444 postgresql-pgrouting_3.6.0-2_armhf.deb
Checksums-Sha256:
a651dbb3939e43ed2332e1383386b7a38a2bb408492a918eef34d81803e44a10 24617516 postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb
45d936e3d99d8326d6c16484666267a043fc9364c0cbc4e17fe342a18959daa8 728456 postgresql-16-pgrouting_3.6.0-2_armhf.deb
f603dcb8d94794e3b4275bd7bf9b62f51b9434a7a0d1b24227c56b5db00f6604 21444 postgresql-pgrouting_3.6.0-2_armhf.deb
Build-Origin: Raspbian
Build-Architecture: armhf
Build-Date: Tue, 28 Nov 2023 05:58:56 +0000
Build-Path: /<<PKGBUILDDIR>>
Installed-Build-Depends:
adduser (= 3.137),
autoconf (= 2.71-3),
automake (= 1:1.16.5-1.3),
autopoint (= 0.21-13),
autotools-dev (= 20220109.1),
base-files (= 13+rpi1),
base-passwd (= 3.6.2),
bash (= 5.2.15-2),
binutils (= 2.41-6+rpi1),
binutils-arm-linux-gnueabihf (= 2.41-6+rpi1),
binutils-common (= 2.41-6+rpi1),
bsdextrautils (= 2.39.2-6),
bsdutils (= 1:2.39.2-6),
build-essential (= 12.9),
bzip2 (= 1.0.8-5+b2),
ca-certificates (= 20230311),
clang-16 (= 1:16.0.6-15+rpi1),
cmake (= 3.27.8-1),
cmake-data (= 3.27.8-1),
coreutils (= 9.1-1),
cpp (= 4:13.2.0-1+rpi1),
cpp-12 (= 12.3.0-10+rpi1),
cpp-13 (= 13.2.0-5+rpi1),
dash (= 0.5.12-6),
debconf (= 1.5.82),
debhelper (= 13.11.8),
debianutils (= 5.14),
dh-autoreconf (= 20),
dh-strip-nondeterminism (= 1.13.1-1),
diffutils (= 1:3.10-1),
docutils-common (= 0.20.1+dfsg-2),
dpkg (= 1.22.1+rpi1),
dpkg-dev (= 1.22.1+rpi1),
dwz (= 0.15-1),
file (= 1:5.45-2),
findutils (= 4.9.0-5),
fontconfig (= 2.14.2-6),
fontconfig-config (= 2.14.2-6),
fonts-dejavu-core (= 2.37-8),
fonts-dejavu-mono (= 2.37-8),
fonts-mathjax (= 2.7.9+dfsg-1),
g++ (= 4:13.2.0-1+rpi1),
g++-13 (= 13.2.0-5+rpi1),
gcc (= 4:13.2.0-1+rpi1),
gcc-12 (= 12.3.0-10+rpi1),
gcc-12-base (= 12.3.0-10+rpi1),
gcc-13 (= 13.2.0-5+rpi1),
gcc-13-base (= 13.2.0-5+rpi1),
gdal-data (= 3.8.0+dfsg-1),
gdal-plugins (= 3.8.0+dfsg-1),
gettext (= 0.21-13),
gettext-base (= 0.21-13),
graphviz (= 2.42.2-7+b2),
grep (= 3.11-3),
groff-base (= 1.23.0-3),
gzip (= 1.12-1),
hostname (= 3.23+nmu1),
icu-devtools (= 72.1-4),
init-system-helpers (= 1.65.2),
intltool-debian (= 0.35.0+20060710.6),
libabsl20220623 (= 20220623.1-3),
libacl1 (= 2.3.1-3),
libaec0 (= 1.1.2-1),
libaom3 (= 3.7.0-1),
libarchive-zip-perl (= 1.68-1),
libarchive13 (= 3.7.2-1),
libarmadillo12 (= 1:12.6.4+dfsg-1),
libarpack2 (= 3.9.1-1),
libasan8 (= 13.2.0-5+rpi1),
libatomic1 (= 13.2.0-5+rpi1),
libattr1 (= 1:2.5.1-4),
libaudit-common (= 1:3.1.1-1),
libaudit1 (= 1:3.1.1-1),
libavif16 (= 1.0.1-2+b1),
libbinutils (= 2.41-6+rpi1),
libblas3 (= 3.11.0-2),
libblkid1 (= 2.39.2-6),
libblosc1 (= 1.21.5+ds-1),
libboost-graph-dev (= 1.74.0.3+b4),
libboost-graph1.74-dev (= 1.74.0+ds1-23),
libboost-graph1.74.0 (= 1.74.0+ds1-23),
libboost-regex1.74-dev (= 1.74.0+ds1-23),
libboost-regex1.74.0 (= 1.74.0+ds1-23),
libboost-serialization1.74-dev (= 1.74.0+ds1-23),
libboost-serialization1.74.0 (= 1.74.0+ds1-23),
libboost-test1.74-dev (= 1.74.0+ds1-23),
libboost-test1.74.0 (= 1.74.0+ds1-23),
libboost1.74-dev (= 1.74.0+ds1-23),
libbrotli1 (= 1.1.0-2),
libbsd0 (= 0.11.7-4),
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),
libcairo2 (= 1.18.0-1),
libcap-ng0 (= 0.8.3-1+b1),
libcap2 (= 1:2.66-4),
libcc1-0 (= 13.2.0-5+rpi1),
libcdt5 (= 2.42.2-7+b2),
libcfitsio10 (= 4.3.0-2),
libcgraph6 (= 2.42.2-7+b2),
libclang-common-16-dev (= 1:16.0.6-15+rpi1),
libclang-cpp16 (= 1:16.0.6-15+rpi1),
libclang1-16 (= 1:16.0.6-15+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),
libcurl3-gnutls (= 8.4.0-2+rpi1),
libcurl4 (= 8.4.0-2+rpi1),
libdatrie1 (= 0.2.13-2+b2),
libdav1d7 (= 1.3.0-2+rpi1),
libdb5.3 (= 5.3.28+dfsg2-2),
libde265-0 (= 1.0.11-1+rpi1+b1),
libdebconfclient0 (= 0.271),
libdebhelper-perl (= 13.11.8),
libdeflate0 (= 1.18-1),
libdpkg-perl (= 1.22.1+rpi1),
libedit2 (= 3.1-20230828-1),
libelf1 (= 0.188-2.1+rpi1),
libexpat1 (= 2.5.0-2),
libffi-dev (= 3.4.4-1),
libffi8 (= 3.4.4-1),
libfile-stripnondeterminism-perl (= 1.13.1-1),
libfontconfig1 (= 2.14.2-6),
libfreetype6 (= 2.13.2+dfsg-1),
libfreexl1 (= 2.0.0-1),
libfribidi0 (= 1.0.13-3),
libfyba0 (= 4.1.1-8),
libgav1-1 (= 0.18.0-1+rpi1+b1),
libgc1 (= 1:8.2.4-1),
libgcc-12-dev (= 12.3.0-10+rpi1),
libgcc-13-dev (= 13.2.0-5+rpi1),
libgcc-s1 (= 13.2.0-5+rpi1),
libgcrypt20 (= 1.10.2-3),
libgd3 (= 2.3.3-9+b1),
libgdal34 (= 3.8.0+dfsg-1),
libgdbm-compat4 (= 1.23-3),
libgdbm6 (= 1.23-3),
libgeos-c1v5 (= 3.12.1-1),
libgeos3.12.1 (= 3.12.1-1),
libgeotiff5 (= 1.7.1-3),
libgfortran5 (= 13.2.0-5+rpi1),
libgif7 (= 5.2.1-2.5),
libglib2.0-0 (= 2.78.1-4),
libgmp10 (= 2:6.3.0+dfsg-2),
libgnutls30 (= 3.8.1-4),
libgomp1 (= 13.2.0-5+rpi1),
libgpg-error0 (= 1.47-2),
libgraphite2-3 (= 1.3.14-1),
libgssapi-krb5-2 (= 1.20.1-4),
libgts-0.7-5 (= 0.7.6+darcs121130-5),
libgvc6 (= 2.42.2-7+b2),
libgvpr2 (= 2.42.2-7+b2),
libharfbuzz0b (= 8.0.1-1),
libhdf4-0-alt (= 4.2.16-3),
libhdf5-103-1 (= 1.10.10+repack-3),
libhdf5-hl-100 (= 1.10.10+repack-3),
libheif-plugin-dav1d (= 1.17.1-1+b1),
libheif-plugin-libde265 (= 1.17.1-1+b1),
libheif1 (= 1.17.1-1+b1),
libhogweed6 (= 3.9.1-2),
libice6 (= 2:1.0.10-1),
libicu-dev (= 72.1-4),
libicu72 (= 72.1-4),
libidn2-0 (= 2.3.4-1),
libisl23 (= 0.26-3),
libjansson4 (= 2.14-2),
libjbig0 (= 2.1-6.1),
libjpeg62-turbo (= 1:2.1.5-2),
libjs-jquery (= 3.6.1+dfsg+~3.5.14-1),
libjs-mathjax (= 2.7.9+dfsg-1),
libjs-sphinxdoc (= 7.2.6-2),
libjs-underscore (= 1.13.4~dfsg+~1.11.4-3),
libjson-c5 (= 0.17-1),
libjson-perl (= 4.10000-1),
libjsoncpp25 (= 1.9.5-6),
libk5crypto3 (= 1.20.1-4),
libkeyutils1 (= 1.6.3-2),
libkmlbase1 (= 1.3.0-10),
libkmldom1 (= 1.3.0-10),
libkmlengine1 (= 1.3.0-10),
libkrb5-3 (= 1.20.1-4),
libkrb5support0 (= 1.20.1-4),
liblab-gamut1 (= 2.42.2-7+b2),
liblapack3 (= 3.11.0-2),
liblcms2-2 (= 2.14-2),
libldap-2.5-0 (= 2.5.13+dfsg-5+rpi1),
liblerc4 (= 4.0.0+ds-3),
libllvm16 (= 1:16.0.6-15+rpi1),
libltdl7 (= 2.4.7-7),
liblz4-1 (= 1.9.4-1+rpi1+b1),
liblzma5 (= 5.4.4-0.1),
libmagic-mgc (= 1:5.45-2),
libmagic1 (= 1:5.45-2),
libmariadb3 (= 1:10.11.3-1+rpi1),
libmd0 (= 1.1.0-1),
libminizip1 (= 1:1.2.13.dfsg-3),
libmount1 (= 2.39.2-6),
libmpc3 (= 1.3.1-1),
libmpfr6 (= 4.2.1-1),
libncurses-dev (= 6.4+20231016-1),
libncurses6 (= 6.4+20231016-1),
libncursesw6 (= 6.4+20231016-1),
libnetcdf19 (= 1:4.9.2-2),
libnettle8 (= 3.9.1-2),
libnghttp2-14 (= 1.58.0-1),
libnsl-dev (= 1.3.0-2),
libnsl2 (= 1.3.0-2),
libnspr4 (= 2:4.35-1.1),
libnss3 (= 2:3.93-1),
libobjc-12-dev (= 12.3.0-10+rpi1),
libobjc4 (= 13.2.0-5+rpi1),
libodbc2 (= 2.3.12-1),
libodbcinst2 (= 2.3.12-1),
libogdi4.1 (= 4.1.0+ds-6),
libopenjp2-7 (= 2.5.0-2),
libp11-kit0 (= 0.25.0-5),
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),
libpango-1.0-0 (= 1.51.0+ds-3),
libpangocairo-1.0-0 (= 1.51.0+ds-3),
libpangoft2-1.0-0 (= 1.51.0+ds-3),
libpathplan4 (= 2.42.2-7+b2),
libpcre2-8-0 (= 10.42-4),
libperl5.36 (= 5.36.0-9),
libpfm4 (= 4.13.0+git15-gefd10fb-2),
libpipeline1 (= 1.5.7-1),
libpixman-1-0 (= 0.42.2-1),
libpng16-16 (= 1.6.40-2),
libpoppler126 (= 22.12.0-2),
libpq-dev (= 16.1-1+rpi1),
libpq5 (= 16.1-1+rpi1),
libproc2-0 (= 2:4.0.4-2),
libproj25 (= 9.3.0-1),
libpsl5 (= 0.21.2-1+b1),
libpython3-stdlib (= 3.11.4-5),
libpython3.11-minimal (= 3.11.6-3),
libpython3.11-stdlib (= 3.11.6-3),
libqhull-r8.0 (= 2020.2-6),
librav1e0 (= 0.6.6-3+rpi1),
libreadline8 (= 8.2-1.3),
librhash0 (= 1.4.3-3),
librtmp1 (= 2.4+20151223.gitfa8646d.1-2+b2),
librttopo1 (= 1.1.0-3),
libsasl2-2 (= 2.1.28+dfsg1-3),
libsasl2-modules-db (= 2.1.28+dfsg1-3),
libseccomp2 (= 2.5.4-1+rpi1+b1),
libselinux1 (= 3.5-1),
libsemanage-common (= 3.5-1),
libsemanage2 (= 3.5-1),
libsepol2 (= 3.5-1),
libsframe1 (= 2.41-6+rpi1),
libsharpyuv0 (= 1.3.2-0.3),
libsm6 (= 2:1.2.3-1),
libsmartcols1 (= 2.39.2-6),
libsnappy1v5 (= 1.1.10-1),
libspatialite8 (= 5.1.0-1),
libsqlite3-0 (= 3.43.2-1),
libssh2-1 (= 1.11.0-2),
libssl-dev (= 3.0.11-1),
libssl3 (= 3.0.11-1),
libstdc++-12-dev (= 12.3.0-10+rpi1),
libstdc++-13-dev (= 13.2.0-5+rpi1),
libstdc++6 (= 13.2.0-5+rpi1),
libsub-override-perl (= 0.09-4),
libsuperlu6 (= 6.0.1+dfsg1-1),
libsvtav1enc1d1 (= 1.7.0+dfsg-2),
libsystemd0 (= 254.5-1+rpi1),
libsz2 (= 1.1.2-1),
libtasn1-6 (= 4.19.0-3),
libthai-data (= 0.1.29-1),
libthai0 (= 0.1.29-1),
libtiff6 (= 4.5.1+git230720-1),
libtinfo6 (= 6.4+20231016-1),
libtirpc-common (= 1.3.3+ds-1),
libtirpc-dev (= 1.3.3+ds-1),
libtirpc3 (= 1.3.3+ds-1),
libtool (= 2.4.7-7),
libubsan1 (= 13.2.0-5+rpi1),
libuchardet0 (= 0.0.7-1),
libudev1 (= 254.5-1+rpi1),
libunistring5 (= 1.1-2),
liburiparser1 (= 0.9.7+dfsg-2),
libuuid1 (= 2.39.2-6),
libuv1 (= 1.46.0-2+rpi1),
libwebp7 (= 1.3.2-0.3),
libx11-6 (= 2:1.8.7-1),
libx11-data (= 2:1.8.7-1),
libxau6 (= 1:1.0.9-1),
libxaw7 (= 2:1.0.14-1),
libxcb-render0 (= 1.15-1),
libxcb-shm0 (= 1.15-1),
libxcb1 (= 1.15-1),
libxdmcp6 (= 1:1.1.2-3),
libxerces-c3.2 (= 3.2.4+debian-1),
libxext6 (= 2:1.3.4-1),
libxml2 (= 2.9.14+dfsg-1.3),
libxml2-dev (= 2.9.14+dfsg-1.3),
libxmu6 (= 2:1.1.3-3),
libxpm4 (= 1:3.5.17-1),
libxrender1 (= 1:0.9.10-1.1),
libxt6 (= 1:1.2.1-1.1),
libyaml-0-2 (= 0.2.5-1),
libyuv0 (= 0.0~git20230907.cbfb661-1),
libz3-4 (= 4.8.12-3.1),
libz3-dev (= 4.8.12-3.1),
libzstd1 (= 1.5.5+dfsg2-2),
linux-libc-dev (= 6.5.6-1+rpi1),
llvm-16 (= 1:16.0.6-15+rpi1),
llvm-16-dev (= 1:16.0.6-15+rpi1),
llvm-16-linker-tools (= 1:16.0.6-15+rpi1),
llvm-16-runtime (= 1:16.0.6-15+rpi1),
llvm-16-tools (= 1:16.0.6-15+rpi1),
login (= 1:4.13+dfsg1-3),
lsb-base (= 11.6+rpi1),
m4 (= 1.4.19-4),
make (= 4.3-4.1),
man-db (= 2.12.0-1),
mariadb-common (= 1:10.11.3-1+rpi1),
mawk (= 1.3.4.20230808-1),
media-types (= 10.1.0),
mysql-common (= 5.8+1.1.0),
ncurses-base (= 6.4+20231016-1),
ncurses-bin (= 6.4+20231016-1),
netbase (= 6.4),
openssl (= 3.0.11-1),
passwd (= 1:4.13+dfsg1-3),
patch (= 2.7.6-7),
perl (= 5.36.0-9),
perl-base (= 5.36.0-9),
perl-modules-5.36 (= 5.36.0-9),
po-debconf (= 1.0.21+nmu1),
postgis (= 3.4.1+dfsg-1),
postgresql-client-16 (= 16.1-1+rpi1),
postgresql-client-common (= 256),
postgresql-common (= 256),
postgresql-server-dev-16 (= 16.1-1+rpi1),
postgresql-server-dev-all (= 256),
procps (= 2:4.0.4-2),
proj-data (= 9.3.0-1),
python-babel-localedata (= 2.10.3-3),
python3 (= 3.11.4-5),
python3-alabaster (= 0.7.12-1),
python3-babel (= 2.10.3-3),
python3-certifi (= 2023.7.22-1),
python3-chardet (= 5.2.0+dfsg-1),
python3-charset-normalizer (= 3.3.2-1),
python3-distutils (= 3.11.5-1),
python3-docutils (= 0.20.1+dfsg-2),
python3-idna (= 3.3-2),
python3-imagesize (= 1.4.1-1),
python3-jinja2 (= 3.1.2-1),
python3-lib2to3 (= 3.11.5-1),
python3-markupsafe (= 2.1.3-1),
python3-minimal (= 3.11.4-5),
python3-packaging (= 23.2-1),
python3-pkg-resources (= 68.1.2-2),
python3-pygments (= 2.15.1+dfsg-1),
python3-requests (= 2.31.0+dfsg-1),
python3-roman (= 3.3-3),
python3-six (= 1.16.0-4),
python3-snowballstemmer (= 2.2.0-4),
python3-sphinx (= 7.2.6-2),
python3-tz (= 2023.3.post1-1),
python3-urllib3 (= 1.26.18-1),
python3-yaml (= 6.0.1-1),
python3.11 (= 3.11.6-3),
python3.11-minimal (= 3.11.6-3),
rdfind (= 1.6.0-1),
readline-common (= 8.2-1.3),
rpcsvc-proto (= 1.4.3-1),
sed (= 4.9-1),
sensible-utils (= 0.0.20),
sgml-base (= 1.31),
sphinx-common (= 7.2.6-2),
ssl-cert (= 1.1.2),
sysvinit-utils (= 3.08-3),
tar (= 1.34+dfsg-1.2),
tzdata (= 2023c-10),
ucf (= 3.0043+nmu1),
unixodbc-common (= 2.3.12-1),
usr-is-merged (= 37),
util-linux (= 2.39.2-6),
x11-common (= 1:7.7+23),
xml-core (= 0.18+nmu1),
xz-utils (= 5.4.4-0.1),
zlib1g (= 1:1.2.13.dfsg-3)
Environment:
DEB_BUILD_OPTIONS="parallel=4"
LANG="en_GB.UTF-8"
LC_ALL="C.UTF-8"
LC_COLLATE="C.UTF-8"
SOURCE_DATE_EPOCH="1700987119"
+------------------------------------------------------------------------------+
| Package contents |
+------------------------------------------------------------------------------+
postgresql-16-pgrouting-dbgsym_3.6.0-2_armhf.deb
------------------------------------------------
new Debian package, version 2.0.
size 24617516 bytes: control archive=552 bytes.
410 bytes, 12 lines control
106 bytes, 1 lines md5sums
Package: postgresql-16-pgrouting-dbgsym
Source: pgrouting
Version: 3.6.0-2
Auto-Built-Package: debug-symbols
Architecture: armhf
Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
Installed-Size: 24626
Depends: postgresql-16-pgrouting (= 3.6.0-2)
Section: debug
Priority: optional
Description: debug symbols for postgresql-16-pgrouting
Build-Ids: f49d620131d2ef2441bb3ac0b0e0783acfeacd62
drwxr-xr-x root/root 0 2023-11-26 08:25 ./
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/debug/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/debug/.build-id/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/debug/.build-id/f4/
-rw-r--r-- root/root 25205948 2023-11-26 08:25 ./usr/lib/debug/.build-id/f4/9d620131d2ef2441bb3ac0b0e0783acfeacd62.debug
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/doc/
lrwxrwxrwx root/root 0 2023-11-26 08:25 ./usr/share/doc/postgresql-16-pgrouting-dbgsym -> postgresql-16-pgrouting
postgresql-16-pgrouting_3.6.0-2_armhf.deb
-----------------------------------------
new Debian package, version 2.0.
size 728456 bytes: control archive=784 bytes.
712 bytes, 16 lines control
339 bytes, 4 lines md5sums
Package: postgresql-16-pgrouting
Source: pgrouting
Version: 3.6.0-2
Architecture: armhf
Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
Installed-Size: 2989
Depends: postgresql-16-pgrouting-scripts (>= 3.6.0-2), postgresql-16, postgresql-16-postgis, postgresql-16-postgis-scripts, libc6 (>= 2.4), libgcc-s1 (>= 3.5), libstdc++6 (>= 13.1)
Suggests: postgresql-16-pgrouting-doc
Section: misc
Priority: optional
Homepage: https://www.pgrouting.org
Description: Routing functionality support for PostgreSQL/PostGIS
pgRouting extends the PostGIS/PostgreSQL geospatial database to provide
geospatial routing and other network analysis functionality.
.
This package supports PostgreSQL 16.
drwxr-xr-x root/root 0 2023-11-26 08:25 ./
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/postgresql/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/postgresql/16/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/lib/postgresql/16/lib/
-rw-r--r-- root/root 3007904 2023-11-26 08:25 ./usr/lib/postgresql/16/lib/libpgrouting-3.6.so
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/doc/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/doc/postgresql-16-pgrouting/
-rw-r--r-- root/root 2241 2023-11-26 08:25 ./usr/share/doc/postgresql-16-pgrouting/changelog.Debian.gz
-rw-r--r-- root/root 8897 2023-11-24 07:33 ./usr/share/doc/postgresql-16-pgrouting/changelog.gz
-rw-r--r-- root/root 28740 2023-09-27 13:08 ./usr/share/doc/postgresql-16-pgrouting/copyright
postgresql-pgrouting_3.6.0-2_armhf.deb
--------------------------------------
new Debian package, version 2.0.
size 21444 bytes: control archive=696 bytes.
605 bytes, 15 lines control
250 bytes, 3 lines md5sums
Package: postgresql-pgrouting
Source: pgrouting
Version: 3.6.0-2
Architecture: armhf
Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
Installed-Size: 47
Depends: postgresql-pgrouting-scripts, postgresql-16-pgrouting
Section: metapackages
Priority: optional
Homepage: https://www.pgrouting.org
Description: Routing functionality support for PostgreSQL/PostGIS - Metapackage
pgRouting extends the PostGIS/PostgreSQL geospatial database to provide
geospatial routing and other network analysis functionality.
.
This metapackage depends on the PgRouting package for PostgreSQL 16.
drwxr-xr-x root/root 0 2023-11-26 08:25 ./
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/doc/
drwxr-xr-x root/root 0 2023-11-26 08:25 ./usr/share/doc/postgresql-pgrouting/
-rw-r--r-- root/root 2239 2023-11-26 08:25 ./usr/share/doc/postgresql-pgrouting/changelog.Debian.gz
-rw-r--r-- root/root 8897 2023-11-24 07:33 ./usr/share/doc/postgresql-pgrouting/changelog.gz
-rw-r--r-- root/root 28740 2023-09-27 13:08 ./usr/share/doc/postgresql-pgrouting/copyright
+------------------------------------------------------------------------------+
| Post Build |
+------------------------------------------------------------------------------+
+------------------------------------------------------------------------------+
| Cleanup |
+------------------------------------------------------------------------------+
Purging /<<BUILDDIR>>
Not cleaning session: cloned chroot in use
+------------------------------------------------------------------------------+
| Summary |
+------------------------------------------------------------------------------+
Build Architecture: armhf
Build Type: any
Build-Space: 410452
Build-Time: 619
Distribution: trixie-staging
Host Architecture: armhf
Install-Time: 208
Job: pgrouting_3.6.0-2
Machine Architecture: arm64
Package: pgrouting
Package-Time: 836
Source-Version: 3.6.0-2
Space: 410452
Status: successful
Version: 3.6.0-2
--------------------------------------------------------------------------------
Finished at 2023-11-28T05:58:57Z
Build needed 00:13:56, 410452k disk space