Build log for pgrouting (3.4.1-1) on armhf

pgrouting → 3.4.1-1 → armhf → 2022-10-14 06:56:40

sbuild (Debian sbuild) 0.78.1 (09 February 2019) on test2019

+==============================================================================+
| pgrouting 3.4.1-1 (armhf)                    Fri, 14 Oct 2022 05:49:01 +0000 |
+==============================================================================+

Package: pgrouting
Version: 3.4.1-1
Source Version: 3.4.1-1
Distribution: bookworm-staging
Machine Architecture: armhf
Host Architecture: armhf
Build Architecture: armhf
Build Type: any

I: NOTICE: Log filtering will replace 'var/run/schroot/mount/bookworm-staging-armhf-sbuild-5036b104-2032-4a8f-9614-15c287b5a9f6' with '<<CHROOT>>'
I: NOTICE: Log filtering will replace 'build/pgrouting-HJA7SL/resolver-Gg9iyh' with '<<RESOLVERDIR>>'

+------------------------------------------------------------------------------+
| Update chroot                                                                |
+------------------------------------------------------------------------------+

Get:1 http://172.17.4.1/private bookworm-staging InRelease [11.3 kB]
Get:2 http://172.17.4.1/private bookworm-staging/main Sources [13.4 MB]
Get:3 http://172.17.4.1/private bookworm-staging/main armhf Packages [14.2 MB]
Fetched 27.6 MB in 13s (2091 kB/s)
Reading package lists...
W: http://172.17.4.1/private/dists/bookworm-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 3753 kB of source archives.
Get:1 http://172.17.4.1/private bookworm-staging/main pgrouting 3.4.1-1 (dsc) [2341 B]
Get:2 http://172.17.4.1/private bookworm-staging/main pgrouting 3.4.1-1 (tar) [3735 kB]
Get:3 http://172.17.4.1/private bookworm-staging/main pgrouting 3.4.1-1 (diff) [15.8 kB]
Fetched 3753 kB in 1s (7179 kB/s)
Download complete and in download only mode
I: NOTICE: Log filtering will replace 'build/pgrouting-HJA7SL/pgrouting-3.4.1' with '<<PKGBUILDDIR>>'
I: NOTICE: Log filtering will replace 'build/pgrouting-HJA7SL' with '<<BUILDDIR>>'

+------------------------------------------------------------------------------+
| Install package build dependencies                                           |
+------------------------------------------------------------------------------+


Setup apt archive
-----------------

Merged Build-Depends: cmake (>= 3.2), debhelper-compat (= 12), 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 (= 12), 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 [957 B]
Ign:3 copy:/<<RESOLVERDIR>>/apt_archive ./ Release.gpg
Get:4 copy:/<<RESOLVERDIR>>/apt_archive ./ Sources [449 B]
Get:5 copy:/<<RESOLVERDIR>>/apt_archive ./ Packages [533 B]
Fetched 1939 B in 0s (36.4 kB/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 packages were automatically installed and are no longer required:
  krb5-locales libpam-cap
Use 'apt autoremove' to remove them.
The following additional packages will be installed:
  autoconf automake autopoint autotools-dev bsdextrautils bsdutils
  ca-certificates clang-14 cmake cmake-data debhelper dh-autoreconf
  dh-elpa-helper dh-strip-nondeterminism docutils-common dwz emacsen-common
  file fontconfig fontconfig-config fonts-dejavu-core fonts-mathjax
  gcc-11-base gdal-data gdal-plugins gettext gettext-base graphviz groff-base
  icu-devtools intltool-debian libaec0 libaom3 libarchive-zip-perl
  libarchive13 libarmadillo11 libarpack2 libasan6 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 libcfitsio9 libcgraph6
  libclang-common-14-dev libclang-cpp14 libclang1-14 libcurl3-gnutls
  libcurl3-nss libcurl4 libdatrie1 libdav1d6 libde265-0 libdebhelper-perl
  libdeflate0 libedit2 libelf1 libexpat1 libffi-dev
  libfile-stripnondeterminism-perl libfontconfig1 libfreetype6 libfreexl1
  libfribidi0 libfyba0 libgc1 libgcc-11-dev libgd3 libgdal31 libgeos-c1v5
  libgeos3.11.0 libgeotiff5 libgfortran5 libgif7 libglib2.0-0 libgraphite2-3
  libgts-0.7-5 libgvc6 libgvpr2 libharfbuzz0b libhdf4-0-alt libhdf5-103-1
  libhdf5-hl-100 libheif1 libice6 libicu-dev libicu71 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 libllvm14 libltdl7 libmagic-mgc libmagic1
  libmariadb3 libmd0 libminizip1 libmount1 libmpdec3 libncurses-dev
  libncurses6 libnetcdf19 libnghttp2-14 libnspr4 libnss3 libobjc-11-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 libpoppler123 libpq-dev libpq5 libprocps8
  libproj25 libpsl5 libpython3-stdlib libpython3.10-minimal
  libpython3.10-stdlib libqhull-r8.0 librhash0 librtmp1 librttopo1 libsm6
  libsmartcols1 libsnappy1v5 libspatialite7 libssh2-1 libssl-dev
  libstdc++-11-dev libsub-override-perl libsuperlu5 libsz2 libthai-data
  libthai0 libtiff5 libtinfo-dev libtool libuchardet0 liburiparser1 libuuid1
  libuv1 libwebp7 libx11-6 libx11-data libx265-199 libxau6 libxaw7
  libxcb-render0 libxcb-shm0 libxcb1 libxdmcp6 libxerces-c3.2 libxext6 libxml2
  libxml2-dev libxmu6 libxpm4 libxrender1 libxt6 libyaml-0-2 libz3-4 libz3-dev
  llvm-14 llvm-14-dev llvm-14-linker-tools llvm-14-runtime llvm-14-tools m4
  man-db mariadb-common media-types mount mysql-common netbase openssl
  po-debconf postgis postgresql-client-14 postgresql-client-common
  postgresql-common postgresql-server-dev-14 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-importlib-metadata
  python3-jinja2 python3-lib2to3 python3-markupsafe python3-minimal
  python3-more-itertools python3-packaging python3-pkg-resources
  python3-pygments python3-pyparsing python3-requests python3-roman
  python3-six python3-snowballstemmer python3-sphinx python3-tz
  python3-urllib3 python3-yaml python3-zipp python3.10 python3.10-minimal
  rdfind sphinx-common ssl-cert ucf unixodbc-common util-linux
  util-linux-extra x11-common xml-core
Suggested packages:
  autoconf-archive gnu-standards autoconf-doc clang-14-doc cmake-doc
  ninja-build cmake-format dh-make 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 libgd-tools geotiff-bin
  gdal-bin libgeotiff-epsg libhdf4-doc libhdf4-alt-dev hdf4-tools icu-doc
  fonts-mathjax-extras fonts-stix libjs-mathjax-doc liblcms2-utils
  cryptsetup-bin ncurses-doc odbc-postgresql tdsodbc ogdi-bin
  postgresql-doc-15 proj-bin libssl-doc libstdc++-11-doc libtool-doc gfortran
  | fortran95-compiler gcj-jdk pkg-config llvm-14-doc m4-doc apparmor less
  www-browser nfs-common libmail-box-perl postgresql-14 postgresql-doc-14
  python3-doc python3-tk python3-venv 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 python-pyparsing-doc
  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.10-venv
  python3.10-doc binfmt-support dosfstools kbd util-linux-locales
Recommended packages:
  curl | wget | lynx fonts-liberation2 libarchive-cpio-perl proj-bin
  libglib2.0-data shared-mime-info xdg-user-dirs libgts-bin 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-14 cmake cmake-data debhelper dh-autoreconf dh-elpa-helper
  dh-strip-nondeterminism docutils-common dwz emacsen-common file fontconfig
  fontconfig-config fonts-dejavu-core fonts-mathjax gcc-11-base gdal-data
  gdal-plugins gettext gettext-base graphviz groff-base icu-devtools
  intltool-debian libaec0 libaom3 libarchive-zip-perl libarchive13
  libarmadillo11 libarpack2 libasan6 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 libcfitsio9 libcgraph6
  libclang-common-14-dev libclang-cpp14 libclang1-14 libcurl3-gnutls
  libcurl3-nss libcurl4 libdatrie1 libdav1d6 libde265-0 libdebhelper-perl
  libdeflate0 libedit2 libelf1 libexpat1 libffi-dev
  libfile-stripnondeterminism-perl libfontconfig1 libfreetype6 libfreexl1
  libfribidi0 libfyba0 libgc1 libgcc-11-dev libgd3 libgdal31 libgeos-c1v5
  libgeos3.11.0 libgeotiff5 libgfortran5 libgif7 libglib2.0-0 libgraphite2-3
  libgts-0.7-5 libgvc6 libgvpr2 libharfbuzz0b libhdf4-0-alt libhdf5-103-1
  libhdf5-hl-100 libheif1 libice6 libicu-dev libicu71 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 libllvm14 libltdl7 libmagic-mgc libmagic1
  libmariadb3 libmd0 libminizip1 libmpdec3 libncurses-dev libncurses6
  libnetcdf19 libnghttp2-14 libnspr4 libnss3 libobjc-11-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 libpoppler123 libpq-dev libpq5 libprocps8 libproj25 libpsl5
  libpython3-stdlib libpython3.10-minimal libpython3.10-stdlib libqhull-r8.0
  librhash0 librtmp1 librttopo1 libsm6 libsnappy1v5 libspatialite7 libssh2-1
  libssl-dev libstdc++-11-dev libsub-override-perl libsuperlu5 libsz2
  libthai-data libthai0 libtiff5 libtinfo-dev libtool libuchardet0
  liburiparser1 libuv1 libwebp7 libx11-6 libx11-data libx265-199 libxau6
  libxaw7 libxcb-render0 libxcb-shm0 libxcb1 libxdmcp6 libxerces-c3.2 libxext6
  libxml2 libxml2-dev libxmu6 libxpm4 libxrender1 libxt6 libyaml-0-2 libz3-4
  libz3-dev llvm-14 llvm-14-dev llvm-14-linker-tools llvm-14-runtime
  llvm-14-tools m4 man-db mariadb-common media-types mysql-common netbase
  openssl po-debconf postgis postgresql-client-14 postgresql-client-common
  postgresql-common postgresql-server-dev-14 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-importlib-metadata
  python3-jinja2 python3-lib2to3 python3-markupsafe python3-minimal
  python3-more-itertools python3-packaging python3-pkg-resources
  python3-pygments python3-pyparsing python3-requests python3-roman
  python3-six python3-snowballstemmer python3-sphinx python3-tz
  python3-urllib3 python3-yaml python3-zipp python3.10 python3.10-minimal
  rdfind sbuild-build-depends-main-dummy sphinx-common ssl-cert ucf
  unixodbc-common x11-common xml-core
The following packages will be upgraded:
  bsdutils libblkid1 libmount1 libsmartcols1 libuuid1 mount util-linux
  util-linux-extra
8 upgraded, 254 newly installed, 0 to remove and 20 not upgraded.
Need to get 221 MB of archives.
After this operation, 1188 MB of additional disk space will be used.
Get:1 copy:/<<RESOLVERDIR>>/apt_archive ./ sbuild-build-depends-main-dummy 0.invalid.0 [952 B]
Get:2 http://172.17.4.1/private bookworm-staging/main armhf bsdutils armhf 1:2.38.1-1.1 [82.5 kB]
Get:3 http://172.17.4.1/private bookworm-staging/main armhf libsmartcols1 armhf 2.38.1-1.1 [90.6 kB]
Get:4 http://172.17.4.1/private bookworm-staging/main armhf util-linux-extra armhf 2.38.1-1.1 [97.1 kB]
Get:5 http://172.17.4.1/private bookworm-staging/main armhf util-linux armhf 2.38.1-1.1 [1063 kB]
Get:6 http://172.17.4.1/private bookworm-staging/main armhf mount armhf 2.38.1-1.1 [125 kB]
Get:7 http://172.17.4.1/private bookworm-staging/main armhf libpython3.10-minimal armhf 3.10.7-1 [813 kB]
Get:8 http://172.17.4.1/private bookworm-staging/main armhf libexpat1 armhf 2.4.9-1 [83.3 kB]
Get:9 http://172.17.4.1/private bookworm-staging/main armhf python3.10-minimal armhf 3.10.7-1 [1518 kB]
Get:10 http://172.17.4.1/private bookworm-staging/main armhf python3-minimal armhf 3.10.6-1 [38.7 kB]
Get:11 http://172.17.4.1/private bookworm-staging/main armhf media-types all 8.0.0 [33.4 kB]
Get:12 http://172.17.4.1/private bookworm-staging/main armhf libmpdec3 armhf 2.5.1-2+rpi1 [73.5 kB]
Get:13 http://172.17.4.1/private bookworm-staging/main armhf libuuid1 armhf 2.38.1-1.1 [25.9 kB]
Get:14 http://172.17.4.1/private bookworm-staging/main armhf libpython3.10-stdlib armhf 3.10.7-1 [1598 kB]
Get:15 http://172.17.4.1/private bookworm-staging/main armhf python3.10 armhf 3.10.7-1 [547 kB]
Get:16 http://172.17.4.1/private bookworm-staging/main armhf libpython3-stdlib armhf 3.10.6-1 [21.7 kB]
Get:17 http://172.17.4.1/private bookworm-staging/main armhf python3 armhf 3.10.6-1 [38.2 kB]
Get:18 http://172.17.4.1/private bookworm-staging/main armhf libblkid1 armhf 2.38.1-1.1 [130 kB]
Get:19 http://172.17.4.1/private bookworm-staging/main armhf libmount1 armhf 2.38.1-1.1 [142 kB]
Get:20 http://172.17.4.1/private bookworm-staging/main armhf libuchardet0 armhf 0.0.7-1 [65.0 kB]
Get:21 http://172.17.4.1/private bookworm-staging/main armhf groff-base armhf 1.22.4-8 [793 kB]
Get:22 http://172.17.4.1/private bookworm-staging/main armhf bsdextrautils armhf 2.38.1-1.1 [78.2 kB]
Get:23 http://172.17.4.1/private bookworm-staging/main armhf libpipeline1 armhf 1.5.6-3 [34.3 kB]
Get:24 http://172.17.4.1/private bookworm-staging/main armhf man-db armhf 2.10.2-3 [1364 kB]
Get:25 http://172.17.4.1/private bookworm-staging/main armhf netbase all 6.3 [19.9 kB]
Get:26 http://172.17.4.1/private bookworm-staging/main armhf libncurses6 armhf 6.3+20220423-2 [79.6 kB]
Get:27 http://172.17.4.1/private bookworm-staging/main armhf libprocps8 armhf 2:3.3.17-7 [60.7 kB]
Get:28 http://172.17.4.1/private bookworm-staging/main armhf procps armhf 2:3.3.17-7 [475 kB]
Get:29 http://172.17.4.1/private bookworm-staging/main armhf openssl armhf 3.0.5-2 [1372 kB]
Get:30 http://172.17.4.1/private bookworm-staging/main armhf ca-certificates all 20211016 [156 kB]
Get:31 http://172.17.4.1/private bookworm-staging/main armhf libmagic-mgc armhf 1:5.41-4 [295 kB]
Get:32 http://172.17.4.1/private bookworm-staging/main armhf libmagic1 armhf 1:5.41-4 [120 kB]
Get:33 http://172.17.4.1/private bookworm-staging/main armhf file armhf 1:5.41-4 [65.8 kB]
Get:34 http://172.17.4.1/private bookworm-staging/main armhf gettext-base armhf 0.21-9 [171 kB]
Get:35 http://172.17.4.1/private bookworm-staging/main armhf ucf all 3.0043 [74.0 kB]
Get:36 http://172.17.4.1/private bookworm-staging/main armhf m4 armhf 1.4.19-1 [260 kB]
Get:37 http://172.17.4.1/private bookworm-staging/main armhf autoconf all 2.71-2 [343 kB]
Get:38 http://172.17.4.1/private bookworm-staging/main armhf autotools-dev all 20220109.1 [51.6 kB]
Get:39 http://172.17.4.1/private bookworm-staging/main armhf automake all 1:1.16.5-1.3 [823 kB]
Get:40 http://172.17.4.1/private bookworm-staging/main armhf autopoint all 0.21-9 [510 kB]
Get:41 http://172.17.4.1/private bookworm-staging/main armhf libmd0 armhf 1.0.4-2 [28.6 kB]
Get:42 http://172.17.4.1/private bookworm-staging/main armhf libbsd0 armhf 0.11.7-1 [112 kB]
Get:43 http://172.17.4.1/private bookworm-staging/main armhf libedit2 armhf 3.1-20210910-1 [81.2 kB]
Get:44 http://172.17.4.1/private bookworm-staging/main armhf libicu71 armhf 71.1-3 [8855 kB]
Get:45 http://172.17.4.1/private bookworm-staging/main armhf libxml2 armhf 2.9.14+dfsg-1 [591 kB]
Get:46 http://172.17.4.1/private bookworm-staging/main armhf libz3-4 armhf 4.8.12-1 [5758 kB]
Get:47 http://172.17.4.1/private bookworm-staging/main armhf libllvm14 armhf 1:14.0.6-2+rpi1 [19.5 MB]
Get:48 http://172.17.4.1/private bookworm-staging/main armhf libclang-cpp14 armhf 1:14.0.6-2+rpi1 [9481 kB]
Get:49 http://172.17.4.1/private bookworm-staging/main armhf gcc-11-base armhf 11.3.0-8+rpi1 [210 kB]
Get:50 http://172.17.4.1/private bookworm-staging/main armhf libasan6 armhf 11.3.0-8+rpi1 [1946 kB]
Get:51 http://172.17.4.1/private bookworm-staging/main armhf libgcc-11-dev armhf 11.3.0-8+rpi1 [697 kB]
Get:52 http://172.17.4.1/private bookworm-staging/main armhf libstdc++-11-dev armhf 11.3.0-8+rpi1 [1975 kB]
Get:53 http://172.17.4.1/private bookworm-staging/main armhf libgc1 armhf 1:8.2.2-3 [235 kB]
Get:54 http://172.17.4.1/private bookworm-staging/main armhf libobjc4 armhf 12.2.0-3+rpi1 [33.6 kB]
Get:55 http://172.17.4.1/private bookworm-staging/main armhf libobjc-11-dev armhf 11.3.0-8+rpi1 [160 kB]
Get:56 http://172.17.4.1/private bookworm-staging/main armhf libclang-common-14-dev armhf 1:14.0.6-2+rpi1 [3698 kB]
Get:57 http://172.17.4.1/private bookworm-staging/main armhf llvm-14-linker-tools armhf 1:14.0.6-2+rpi1 [1071 kB]
Get:58 http://172.17.4.1/private bookworm-staging/main armhf libclang1-14 armhf 1:14.0.6-2+rpi1 [5235 kB]
Get:59 http://172.17.4.1/private bookworm-staging/main armhf clang-14 armhf 1:14.0.6-2+rpi1 [122 kB]
Get:60 http://172.17.4.1/private bookworm-staging/main armhf libarchive13 armhf 3.6.0-1 [306 kB]
Get:61 http://172.17.4.1/private bookworm-staging/main armhf libbrotli1 armhf 1.0.9-2+b2 [260 kB]
Get:62 http://172.17.4.1/private bookworm-staging/main armhf libnghttp2-14 armhf 1.50.0-1 [65.0 kB]
Get:63 http://172.17.4.1/private bookworm-staging/main armhf libpsl5 armhf 0.21.0-1.2 [56.2 kB]
Get:64 http://172.17.4.1/private bookworm-staging/main armhf librtmp1 armhf 2.4+20151223.gitfa8646d.1-2+b2 [54.2 kB]
Get:65 http://172.17.4.1/private bookworm-staging/main armhf libssh2-1 armhf 1.10.0-3+b1 [161 kB]
Get:66 http://172.17.4.1/private bookworm-staging/main armhf libcurl4 armhf 7.85.0-1 [325 kB]
Get:67 http://172.17.4.1/private bookworm-staging/main armhf libjsoncpp25 armhf 1.9.5-4 [66.7 kB]
Get:68 http://172.17.4.1/private bookworm-staging/main armhf librhash0 armhf 1.4.3-3 [142 kB]
Get:69 http://172.17.4.1/private bookworm-staging/main armhf libuv1 armhf 1.44.2-1+rpi1 [125 kB]
Get:70 http://172.17.4.1/private bookworm-staging/main armhf dh-elpa-helper all 2.0.14 [11.5 kB]
Get:71 http://172.17.4.1/private bookworm-staging/main armhf emacsen-common all 3.0.4 [19.3 kB]
Get:72 http://172.17.4.1/private bookworm-staging/main armhf cmake-data all 3.24.2-1 [2019 kB]
Get:73 http://172.17.4.1/private bookworm-staging/main armhf cmake armhf 3.24.2-1 [3661 kB]
Get:74 http://172.17.4.1/private bookworm-staging/main armhf libdebhelper-perl all 13.10 [79.8 kB]
Get:75 http://172.17.4.1/private bookworm-staging/main armhf libtool all 2.4.7-4 [526 kB]
Get:76 http://172.17.4.1/private bookworm-staging/main armhf dh-autoreconf all 20 [17.1 kB]
Get:77 http://172.17.4.1/private bookworm-staging/main armhf libarchive-zip-perl all 1.68-1 [104 kB]
Get:78 http://172.17.4.1/private bookworm-staging/main armhf libsub-override-perl all 0.09-3 [10.4 kB]
Get:79 http://172.17.4.1/private bookworm-staging/main armhf libfile-stripnondeterminism-perl all 1.13.0-1 [26.6 kB]
Get:80 http://172.17.4.1/private bookworm-staging/main armhf dh-strip-nondeterminism all 1.13.0-1 [15.8 kB]
Get:81 http://172.17.4.1/private bookworm-staging/main armhf libelf1 armhf 0.187-2+rpi2 [177 kB]
Get:82 http://172.17.4.1/private bookworm-staging/main armhf dwz armhf 0.14+20220924-2 [93.1 kB]
Get:83 http://172.17.4.1/private bookworm-staging/main armhf gettext armhf 0.21-9 [1220 kB]
Get:84 http://172.17.4.1/private bookworm-staging/main armhf intltool-debian all 0.35.0+20060710.5 [26.8 kB]
Get:85 http://172.17.4.1/private bookworm-staging/main armhf po-debconf all 1.0.21+nmu1 [248 kB]
Get:86 http://172.17.4.1/private bookworm-staging/main armhf debhelper all 13.10 [940 kB]
Get:87 http://172.17.4.1/private bookworm-staging/main armhf xml-core all 0.18+nmu1 [23.8 kB]
Get:88 http://172.17.4.1/private bookworm-staging/main armhf docutils-common all 0.17.1+dfsg-2 [127 kB]
Get:89 http://172.17.4.1/private bookworm-staging/main armhf libpng16-16 armhf 1.6.38-2 [273 kB]
Get:90 http://172.17.4.1/private bookworm-staging/main armhf libfreetype6 armhf 2.12.1+dfsg-3 [352 kB]
Get:91 http://172.17.4.1/private bookworm-staging/main armhf fonts-dejavu-core all 2.37-2 [1069 kB]
Get:92 http://172.17.4.1/private bookworm-staging/main armhf fontconfig-config armhf 2.13.1-4.5 [281 kB]
Get:93 http://172.17.4.1/private bookworm-staging/main armhf libfontconfig1 armhf 2.13.1-4.5 [330 kB]
Get:94 http://172.17.4.1/private bookworm-staging/main armhf fontconfig armhf 2.13.1-4.5 [416 kB]
Get:95 http://172.17.4.1/private bookworm-staging/main armhf fonts-mathjax all 2.7.9+dfsg-1 [2210 kB]
Get:96 http://172.17.4.1/private bookworm-staging/main armhf gdal-data all 3.5.2+dfsg-1 [530 kB]
Get:97 http://172.17.4.1/private bookworm-staging/main armhf gdal-plugins armhf 3.5.2+dfsg-1 [324 kB]
Get:98 http://172.17.4.1/private bookworm-staging/main armhf libcdt5 armhf 2.42.2-7 [59.7 kB]
Get:99 http://172.17.4.1/private bookworm-staging/main armhf libcgraph6 armhf 2.42.2-7 [78.7 kB]
Get:100 http://172.17.4.1/private bookworm-staging/main armhf libjpeg62-turbo armhf 1:2.1.2-1 [144 kB]
Get:101 http://172.17.4.1/private bookworm-staging/main armhf libdeflate0 armhf 1.14-1 [50.9 kB]
Get:102 http://172.17.4.1/private bookworm-staging/main armhf libjbig0 armhf 2.1-3.1+b2 [27.6 kB]
Get:103 http://172.17.4.1/private bookworm-staging/main armhf liblerc4 armhf 4.0.0+ds-1 [121 kB]
Get:104 http://172.17.4.1/private bookworm-staging/main armhf libwebp7 armhf 1.2.2-2 [237 kB]
Get:105 http://172.17.4.1/private bookworm-staging/main armhf libtiff5 armhf 4.4.0-4 [290 kB]
Get:106 http://172.17.4.1/private bookworm-staging/main armhf libxau6 armhf 1:1.0.9-1 [19.1 kB]
Get:107 http://172.17.4.1/private bookworm-staging/main armhf libxdmcp6 armhf 1:1.1.2-3 [25.0 kB]
Get:108 http://172.17.4.1/private bookworm-staging/main armhf libxcb1 armhf 1.15-1 [139 kB]
Get:109 http://172.17.4.1/private bookworm-staging/main armhf libx11-data all 2:1.8.1-2 [308 kB]
Get:110 http://172.17.4.1/private bookworm-staging/main armhf libx11-6 armhf 2:1.8.1-2 [704 kB]
Get:111 http://172.17.4.1/private bookworm-staging/main armhf libxpm4 armhf 1:3.5.12-1 [43.6 kB]
Get:112 http://172.17.4.1/private bookworm-staging/main armhf libgd3 armhf 2.3.3-6+b3 [117 kB]
Get:113 http://172.17.4.1/private bookworm-staging/main armhf libglib2.0-0 armhf 2.74.0-2 [1265 kB]
Get:114 http://172.17.4.1/private bookworm-staging/main armhf libgts-0.7-5 armhf 0.7.6+darcs121130-5 [134 kB]
Get:115 http://172.17.4.1/private bookworm-staging/main armhf libpixman-1-0 armhf 0.40.0-1 [463 kB]
Get:116 http://172.17.4.1/private bookworm-staging/main armhf libxcb-render0 armhf 1.15-1 [114 kB]
Get:117 http://172.17.4.1/private bookworm-staging/main armhf libxcb-shm0 armhf 1.15-1 [106 kB]
Get:118 http://172.17.4.1/private bookworm-staging/main armhf libxext6 armhf 2:1.3.4-1 [48.0 kB]
Get:119 http://172.17.4.1/private bookworm-staging/main armhf libxrender1 armhf 1:0.9.10-1.1 [30.0 kB]
Get:120 http://172.17.4.1/private bookworm-staging/main armhf libcairo2 armhf 1.16.0-6 [496 kB]
Get:121 http://172.17.4.1/private bookworm-staging/main armhf libltdl7 armhf 2.4.7-4 [399 kB]
Get:122 http://172.17.4.1/private bookworm-staging/main armhf libfribidi0 armhf 1.0.8-2.1 [63.7 kB]
Get:123 http://172.17.4.1/private bookworm-staging/main armhf libgraphite2-3 armhf 1.3.14-1 [70.3 kB]
Get:124 http://172.17.4.1/private bookworm-staging/main armhf libharfbuzz0b armhf 5.2.0-2 [1835 kB]
Get:125 http://172.17.4.1/private bookworm-staging/main armhf libthai-data all 0.1.29-1 [176 kB]
Get:126 http://172.17.4.1/private bookworm-staging/main armhf libdatrie1 armhf 0.2.13-2+b2 [39.9 kB]
Get:127 http://172.17.4.1/private bookworm-staging/main armhf libthai0 armhf 0.1.29-1 [54.5 kB]
Get:128 http://172.17.4.1/private bookworm-staging/main armhf libpango-1.0-0 armhf 1.50.10+ds-1 [214 kB]
Get:129 http://172.17.4.1/private bookworm-staging/main armhf libpangoft2-1.0-0 armhf 1.50.10+ds-1 [68.6 kB]
Get:130 http://172.17.4.1/private bookworm-staging/main armhf libpangocairo-1.0-0 armhf 1.50.10+ds-1 [58.3 kB]
Get:131 http://172.17.4.1/private bookworm-staging/main armhf libpathplan4 armhf 2.42.2-7 [62.0 kB]
Get:132 http://172.17.4.1/private bookworm-staging/main armhf libgvc6 armhf 2.42.2-7 [585 kB]
Get:133 http://172.17.4.1/private bookworm-staging/main armhf libgvpr2 armhf 2.42.2-7 [185 kB]
Get:134 http://172.17.4.1/private bookworm-staging/main armhf liblab-gamut1 armhf 2.42.2-7 [221 kB]
Get:135 http://172.17.4.1/private bookworm-staging/main armhf x11-common all 1:7.7+23 [252 kB]
Get:136 http://172.17.4.1/private bookworm-staging/main armhf libice6 armhf 2:1.0.10-1 [51.7 kB]
Get:137 http://172.17.4.1/private bookworm-staging/main armhf libsm6 armhf 2:1.2.3-1 [32.9 kB]
Get:138 http://172.17.4.1/private bookworm-staging/main armhf libxt6 armhf 1:1.2.1-1 [159 kB]
Get:139 http://172.17.4.1/private bookworm-staging/main armhf libxmu6 armhf 2:1.1.3-3 [52.0 kB]
Get:140 http://172.17.4.1/private bookworm-staging/main armhf libxaw7 armhf 2:1.0.14-1 [165 kB]
Get:141 http://172.17.4.1/private bookworm-staging/main armhf graphviz armhf 2.42.2-7 [500 kB]
Get:142 http://172.17.4.1/private bookworm-staging/main armhf icu-devtools armhf 71.1-3 [177 kB]
Get:143 http://172.17.4.1/private bookworm-staging/main armhf libaec0 armhf 1.0.6-1 [19.3 kB]
Get:144 http://172.17.4.1/private bookworm-staging/main armhf libaom3 armhf 3.5.0-1 [1302 kB]
Get:145 http://172.17.4.1/private bookworm-staging/main armhf libblas3 armhf 3.10.1-2 [109 kB]
Get:146 http://172.17.4.1/private bookworm-staging/main armhf libgfortran5 armhf 12.2.0-3+rpi1 [238 kB]
Get:147 http://172.17.4.1/private bookworm-staging/main armhf liblapack3 armhf 3.10.1-2 [1587 kB]
Get:148 http://172.17.4.1/private bookworm-staging/main armhf libarpack2 armhf 3.8.0-1 [85.9 kB]
Get:149 http://172.17.4.1/private bookworm-staging/main armhf libsuperlu5 armhf 5.3.0+dfsg1-2 [128 kB]
Get:150 http://172.17.4.1/private bookworm-staging/main armhf libarmadillo11 armhf 1:11.2.3+dfsg-1 [100.0 kB]
Get:151 http://172.17.4.1/private bookworm-staging/main armhf libsnappy1v5 armhf 1.1.9-2 [25.5 kB]
Get:152 http://172.17.4.1/private bookworm-staging/main armhf libblosc1 armhf 1.21.1+ds2-3 [38.9 kB]
Get:153 http://172.17.4.1/private bookworm-staging/main armhf libboost1.74-dev armhf 1.74.0-17 [9534 kB]
Get:154 http://172.17.4.1/private bookworm-staging/main armhf libboost-regex1.74.0 armhf 1.74.0-17 [444 kB]
Get:155 http://172.17.4.1/private bookworm-staging/main armhf libboost-graph1.74.0 armhf 1.74.0-17 [308 kB]
Get:156 http://172.17.4.1/private bookworm-staging/main armhf libicu-dev armhf 71.1-3 [9799 kB]
Get:157 http://172.17.4.1/private bookworm-staging/main armhf libboost-regex1.74-dev armhf 1.74.0-17 [550 kB]
Get:158 http://172.17.4.1/private bookworm-staging/main armhf libboost-serialization1.74.0 armhf 1.74.0-17 [322 kB]
Get:159 http://172.17.4.1/private bookworm-staging/main armhf libboost-serialization1.74-dev armhf 1.74.0-17 [387 kB]
Get:160 http://172.17.4.1/private bookworm-staging/main armhf libboost-test1.74.0 armhf 1.74.0-17 [429 kB]
Get:161 http://172.17.4.1/private bookworm-staging/main armhf libboost-test1.74-dev armhf 1.74.0-17 [516 kB]
Get:162 http://172.17.4.1/private bookworm-staging/main armhf libboost-graph1.74-dev armhf 1.74.0-17 [1545 kB]
Get:163 http://172.17.4.1/private bookworm-staging/main armhf libboost-graph-dev armhf 1.74.0.3+b4 [4712 B]
Get:164 http://172.17.4.1/private bookworm-staging/main armhf libcurl3-gnutls armhf 7.85.0-1 [320 kB]
Get:165 http://172.17.4.1/private bookworm-staging/main armhf libcfitsio9 armhf 4.1.0-1 [498 kB]
Get:166 http://172.17.4.1/private bookworm-staging/main armhf libnspr4 armhf 2:4.35-1 [90.9 kB]
Get:167 http://172.17.4.1/private bookworm-staging/main armhf libnss3 armhf 2:3.83-1 [1106 kB]
Get:168 http://172.17.4.1/private bookworm-staging/main armhf libcurl3-nss armhf 7.85.0-1 [327 kB]
Get:169 http://172.17.4.1/private bookworm-staging/main armhf libdav1d6 armhf 1.0.0-2+rpi1 [205 kB]
Get:170 http://172.17.4.1/private bookworm-staging/main armhf libde265-0 armhf 1.0.8-1+rpi1+b1 [220 kB]
Get:171 http://172.17.4.1/private bookworm-staging/main armhf libffi-dev armhf 3.4.2-4 [61.7 kB]
Get:172 http://172.17.4.1/private bookworm-staging/main armhf libfreexl1 armhf 1.0.6-1 [31.8 kB]
Get:173 http://172.17.4.1/private bookworm-staging/main armhf libfyba0 armhf 4.1.1-7 [99.5 kB]
Get:174 http://172.17.4.1/private bookworm-staging/main armhf libgeos3.11.0 armhf 3.11.0-2 [654 kB]
Get:175 http://172.17.4.1/private bookworm-staging/main armhf libgeos-c1v5 armhf 3.11.0-2 [77.1 kB]
Get:176 http://172.17.4.1/private bookworm-staging/main armhf proj-data all 9.1.0-1 [6222 kB]
Get:177 http://172.17.4.1/private bookworm-staging/main armhf libproj25 armhf 9.1.0-1 [1055 kB]
Get:178 http://172.17.4.1/private bookworm-staging/main armhf libgeotiff5 armhf 1.7.1-1+b1 [63.3 kB]
Get:179 http://172.17.4.1/private bookworm-staging/main armhf libgif7 armhf 5.2.1-2.5 [44.7 kB]
Get:180 http://172.17.4.1/private bookworm-staging/main armhf libhdf4-0-alt armhf 4.2.15-4 [240 kB]
Get:181 http://172.17.4.1/private bookworm-staging/main armhf libsz2 armhf 1.0.6-1 [7452 B]
Get:182 http://172.17.4.1/private bookworm-staging/main armhf libhdf5-103-1 armhf 1.10.8+repack-1 [1235 kB]
Get:183 http://172.17.4.1/private bookworm-staging/main armhf libx265-199 armhf 3.5-2 [548 kB]
Get:184 http://172.17.4.1/private bookworm-staging/main armhf libheif1 armhf 1.13.0-1 [169 kB]
Get:185 http://172.17.4.1/private bookworm-staging/main armhf libjson-c5 armhf 0.16-2 [40.0 kB]
Get:186 http://172.17.4.1/private bookworm-staging/main armhf libminizip1 armhf 1.1-8+b1 [18.3 kB]
Get:187 http://172.17.4.1/private bookworm-staging/main armhf liburiparser1 armhf 0.9.6+dfsg-1 [37.6 kB]
Get:188 http://172.17.4.1/private bookworm-staging/main armhf libkmlbase1 armhf 1.3.0-9 [43.4 kB]
Get:189 http://172.17.4.1/private bookworm-staging/main armhf libkmldom1 armhf 1.3.0-9 [127 kB]
Get:190 http://172.17.4.1/private bookworm-staging/main armhf libkmlengine1 armhf 1.3.0-9 [66.1 kB]
Get:191 http://172.17.4.1/private bookworm-staging/main armhf mysql-common all 5.8+1.0.8 [7528 B]
Get:192 http://172.17.4.1/private bookworm-staging/main armhf mariadb-common all 1:10.6.10-1 [37.2 kB]
Get:193 http://172.17.4.1/private bookworm-staging/main armhf libmariadb3 armhf 1:10.6.10-1 [163 kB]
Get:194 http://172.17.4.1/private bookworm-staging/main armhf libhdf5-hl-100 armhf 1.10.8+repack-1 [81.7 kB]
Get:195 http://172.17.4.1/private bookworm-staging/main armhf libnetcdf19 armhf 1:4.9.0-3+b2 [416 kB]
Get:196 http://172.17.4.1/private bookworm-staging/main armhf libodbc2 armhf 2.3.11-2 [134 kB]
Get:197 http://172.17.4.1/private bookworm-staging/main armhf unixodbc-common all 2.3.11-2 [18.7 kB]
Get:198 http://172.17.4.1/private bookworm-staging/main armhf libodbcinst2 armhf 2.3.11-2 [38.3 kB]
Get:199 http://172.17.4.1/private bookworm-staging/main armhf libogdi4.1 armhf 4.1.0+ds-5+b1 [172 kB]
Get:200 http://172.17.4.1/private bookworm-staging/main armhf libopenjp2-7 armhf 2.5.0-1 [165 kB]
Get:201 http://172.17.4.1/private bookworm-staging/main armhf liblcms2-2 armhf 2.13.1-1 [125 kB]
Get:202 http://172.17.4.1/private bookworm-staging/main armhf libpoppler123 armhf 22.08.0-2.1 [1693 kB]
Get:203 http://172.17.4.1/private bookworm-staging/main armhf libpq5 armhf 15~rc2-1 [160 kB]
Get:204 http://172.17.4.1/private bookworm-staging/main armhf libqhull-r8.0 armhf 2020.2-5 [221 kB]
Get:205 http://172.17.4.1/private bookworm-staging/main armhf librttopo1 armhf 1.1.0-2 [145 kB]
Get:206 http://172.17.4.1/private bookworm-staging/main armhf libspatialite7 armhf 5.0.1-2+b2 [1654 kB]
Get:207 http://172.17.4.1/private bookworm-staging/main armhf libxerces-c3.2 armhf 3.2.3+debian-3+b1 [710 kB]
Get:208 http://172.17.4.1/private bookworm-staging/main armhf libgdal31 armhf 3.5.2+dfsg-1 [6257 kB]
Get:209 http://172.17.4.1/private bookworm-staging/main armhf libjs-jquery all 3.6.1+dfsg+~3.5.14-1 [326 kB]
Get:210 http://172.17.4.1/private bookworm-staging/main armhf libjs-mathjax all 2.7.9+dfsg-1 [5667 kB]
Get:211 http://172.17.4.1/private bookworm-staging/main armhf libjs-underscore all 1.13.4~dfsg+~1.11.4-1 [119 kB]
Get:212 http://172.17.4.1/private bookworm-staging/main armhf libjs-sphinxdoc all 4.5.0-4 [142 kB]
Get:213 http://172.17.4.1/private bookworm-staging/main armhf libjson-perl all 4.10000-1 [87.5 kB]
Get:214 http://172.17.4.1/private bookworm-staging/main armhf libncurses-dev armhf 6.3+20220423-2 [289 kB]
Get:215 http://172.17.4.1/private bookworm-staging/main armhf libpfm4 armhf 4.12.0-1 [48.9 kB]
Get:216 http://172.17.4.1/private bookworm-staging/main armhf libssl-dev armhf 3.0.5-2 [2116 kB]
Get:217 http://172.17.4.1/private bookworm-staging/main armhf libpq-dev armhf 15~rc2-1 [127 kB]
Get:218 http://172.17.4.1/private bookworm-staging/main armhf libtinfo-dev armhf 6.3+20220423-2 [932 B]
Get:219 http://172.17.4.1/private bookworm-staging/main armhf libxml2-dev armhf 2.9.14+dfsg-1 [656 kB]
Get:220 http://172.17.4.1/private bookworm-staging/main armhf libyaml-0-2 armhf 0.2.5-1 [44.6 kB]
Get:221 http://172.17.4.1/private bookworm-staging/main armhf libz3-dev armhf 4.8.12-1 [91.9 kB]
Get:222 http://172.17.4.1/private bookworm-staging/main armhf llvm-14-runtime armhf 1:14.0.6-2+rpi1 [457 kB]
Get:223 http://172.17.4.1/private bookworm-staging/main armhf llvm-14 armhf 1:14.0.6-2+rpi1 [10.0 MB]
Get:224 http://172.17.4.1/private bookworm-staging/main armhf python3-pkg-resources all 59.6.0-1.2 [196 kB]
Get:225 http://172.17.4.1/private bookworm-staging/main armhf python3-pygments all 2.12.0+dfsg-2 [765 kB]
Get:226 http://172.17.4.1/private bookworm-staging/main armhf python3-yaml armhf 5.4.1-1+b1 [151 kB]
Get:227 http://172.17.4.1/private bookworm-staging/main armhf llvm-14-tools armhf 1:14.0.6-2+rpi1 [392 kB]
Get:228 http://172.17.4.1/private bookworm-staging/main armhf llvm-14-dev armhf 1:14.0.6-2+rpi1 [33.9 MB]
Get:229 http://172.17.4.1/private bookworm-staging/main armhf postgis armhf 3.3.1+dfsg-1 [137 kB]
Get:230 http://172.17.4.1/private bookworm-staging/main armhf postgresql-client-common all 243 [91.8 kB]
Get:231 http://172.17.4.1/private bookworm-staging/main armhf postgresql-client-14 armhf 14.5-2 [1497 kB]
Get:232 http://172.17.4.1/private bookworm-staging/main armhf ssl-cert all 1.1.2 [21.1 kB]
Get:233 http://172.17.4.1/private bookworm-staging/main armhf postgresql-common all 243 [231 kB]
Get:234 http://172.17.4.1/private bookworm-staging/main armhf postgresql-server-dev-14 armhf 14.5-2 [1105 kB]
Get:235 http://172.17.4.1/private bookworm-staging/main armhf postgresql-server-dev-all armhf 243 [77.3 kB]
Get:236 http://172.17.4.1/private bookworm-staging/main armhf python-babel-localedata all 2.10.3-1 [5615 kB]
Get:237 http://172.17.4.1/private bookworm-staging/main armhf python3-alabaster all 0.7.12-1 [20.8 kB]
Get:238 http://172.17.4.1/private bookworm-staging/main armhf python3-tz all 2022.4-1 [34.9 kB]
Get:239 http://172.17.4.1/private bookworm-staging/main armhf python3-babel all 2.10.3-1 [103 kB]
Get:240 http://172.17.4.1/private bookworm-staging/main armhf python3-certifi all 2022.6.15-2 [154 kB]
Get:241 http://172.17.4.1/private bookworm-staging/main armhf python3-chardet all 4.0.0-2 [99.1 kB]
Get:242 http://172.17.4.1/private bookworm-staging/main armhf python3-charset-normalizer all 2.0.6-2 [30.6 kB]
Get:243 http://172.17.4.1/private bookworm-staging/main armhf python3-lib2to3 all 3.10.7-1 [79.9 kB]
Get:244 http://172.17.4.1/private bookworm-staging/main armhf python3-distutils all 3.10.7-1 [141 kB]
Get:245 http://172.17.4.1/private bookworm-staging/main armhf python3-roman all 3.3-1 [10.7 kB]
Get:246 http://172.17.4.1/private bookworm-staging/main armhf python3-docutils all 0.17.1+dfsg-2 [393 kB]
Get:247 http://172.17.4.1/private bookworm-staging/main armhf python3-idna all 3.3-1 [39.4 kB]
Get:248 http://172.17.4.1/private bookworm-staging/main armhf python3-imagesize all 1.4.1-1 [6688 B]
Get:249 http://172.17.4.1/private bookworm-staging/main armhf python3-more-itertools all 8.10.0-2 [53.0 kB]
Get:250 http://172.17.4.1/private bookworm-staging/main armhf python3-zipp all 1.0.0-4 [6160 B]
Get:251 http://172.17.4.1/private bookworm-staging/main armhf python3-importlib-metadata all 4.12.0-1 [24.9 kB]
Get:252 http://172.17.4.1/private bookworm-staging/main armhf python3-markupsafe armhf 2.1.1-1 [13.6 kB]
Get:253 http://172.17.4.1/private bookworm-staging/main armhf python3-jinja2 all 3.0.3-2 [121 kB]
Get:254 http://172.17.4.1/private bookworm-staging/main armhf python3-pyparsing all 3.0.7-2 [140 kB]
Get:255 http://172.17.4.1/private bookworm-staging/main armhf python3-packaging all 21.3-1.1 [34.2 kB]
Get:256 http://172.17.4.1/private bookworm-staging/main armhf python3-six all 1.16.0-4 [17.5 kB]
Get:257 http://172.17.4.1/private bookworm-staging/main armhf python3-urllib3 all 1.26.12-1 [117 kB]
Get:258 http://172.17.4.1/private bookworm-staging/main armhf python3-requests all 2.27.1+dfsg-1 [71.9 kB]
Get:259 http://172.17.4.1/private bookworm-staging/main armhf python3-snowballstemmer all 2.2.0-1 [58.5 kB]
Get:260 http://172.17.4.1/private bookworm-staging/main armhf sphinx-common all 4.5.0-4 [638 kB]
Get:261 http://172.17.4.1/private bookworm-staging/main armhf python3-sphinx all 4.5.0-4 [540 kB]
Get:262 http://172.17.4.1/private bookworm-staging/main armhf rdfind armhf 1.5.0-1.1 [35.1 kB]
debconf: delaying package configuration, since apt-utils is not installed
Fetched 221 MB in 46s (4851 kB/s)
(Reading database ... 14692 files and directories currently installed.)
Preparing to unpack .../bsdutils_1%3a2.38.1-1.1_armhf.deb ...
Unpacking bsdutils (1:2.38.1-1.1) over (1:2.38.1-1) ...
Setting up bsdutils (1:2.38.1-1.1) ...
(Reading database ... 14692 files and directories currently installed.)
Preparing to unpack .../libsmartcols1_2.38.1-1.1_armhf.deb ...
Unpacking libsmartcols1:armhf (2.38.1-1.1) over (2.38.1-1) ...
Setting up libsmartcols1:armhf (2.38.1-1.1) ...
(Reading database ... 14692 files and directories currently installed.)
Preparing to unpack .../util-linux-extra_2.38.1-1.1_armhf.deb ...
Unpacking util-linux-extra (2.38.1-1.1) over (2.38.1-1) ...
Setting up util-linux-extra (2.38.1-1.1) ...
(Reading database ... 14692 files and directories currently installed.)
Preparing to unpack .../util-linux_2.38.1-1.1_armhf.deb ...
Unpacking util-linux (2.38.1-1.1) over (2.38.1-1) ...
Setting up util-linux (2.38.1-1.1) ...
(Reading database ... 14694 files and directories currently installed.)
Preparing to unpack .../mount_2.38.1-1.1_armhf.deb ...
Unpacking mount (2.38.1-1.1) over (2.38.1-1) ...
Selecting previously unselected package libpython3.10-minimal:armhf.
Preparing to unpack .../libpython3.10-minimal_3.10.7-1_armhf.deb ...
Unpacking libpython3.10-minimal:armhf (3.10.7-1) ...
Selecting previously unselected package libexpat1:armhf.
Preparing to unpack .../libexpat1_2.4.9-1_armhf.deb ...
Unpacking libexpat1:armhf (2.4.9-1) ...
Selecting previously unselected package python3.10-minimal.
Preparing to unpack .../python3.10-minimal_3.10.7-1_armhf.deb ...
Unpacking python3.10-minimal (3.10.7-1) ...
Setting up libpython3.10-minimal:armhf (3.10.7-1) ...
Setting up libexpat1:armhf (2.4.9-1) ...
Setting up python3.10-minimal (3.10.7-1) ...
Selecting previously unselected package python3-minimal.
(Reading database ... 14997 files and directories currently installed.)
Preparing to unpack .../python3-minimal_3.10.6-1_armhf.deb ...
Unpacking python3-minimal (3.10.6-1) ...
Selecting previously unselected package media-types.
Preparing to unpack .../media-types_8.0.0_all.deb ...
Unpacking media-types (8.0.0) ...
Selecting previously unselected package libmpdec3:armhf.
Preparing to unpack .../libmpdec3_2.5.1-2+rpi1_armhf.deb ...
Unpacking libmpdec3:armhf (2.5.1-2+rpi1) ...
Preparing to unpack .../libuuid1_2.38.1-1.1_armhf.deb ...
Unpacking libuuid1:armhf (2.38.1-1.1) over (2.38.1-1) ...
Setting up libuuid1:armhf (2.38.1-1.1) ...
Selecting previously unselected package libpython3.10-stdlib:armhf.
(Reading database ... 15032 files and directories currently installed.)
Preparing to unpack .../libpython3.10-stdlib_3.10.7-1_armhf.deb ...
Unpacking libpython3.10-stdlib:armhf (3.10.7-1) ...
Selecting previously unselected package python3.10.
Preparing to unpack .../python3.10_3.10.7-1_armhf.deb ...
Unpacking python3.10 (3.10.7-1) ...
Selecting previously unselected package libpython3-stdlib:armhf.
Preparing to unpack .../libpython3-stdlib_3.10.6-1_armhf.deb ...
Unpacking libpython3-stdlib:armhf (3.10.6-1) ...
Setting up python3-minimal (3.10.6-1) ...
Selecting previously unselected package python3.
(Reading database ... 15399 files and directories currently installed.)
Preparing to unpack .../python3_3.10.6-1_armhf.deb ...
Unpacking python3 (3.10.6-1) ...
Preparing to unpack .../libblkid1_2.38.1-1.1_armhf.deb ...
Unpacking libblkid1:armhf (2.38.1-1.1) over (2.38.1-1) ...
Setting up libblkid1:armhf (2.38.1-1.1) ...
(Reading database ... 15419 files and directories currently installed.)
Preparing to unpack .../libmount1_2.38.1-1.1_armhf.deb ...
Unpacking libmount1:armhf (2.38.1-1.1) over (2.38.1-1) ...
Setting up libmount1:armhf (2.38.1-1.1) ...
Selecting previously unselected package libuchardet0:armhf.
(Reading database ... 15419 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.22.4-8_armhf.deb ...
Unpacking groff-base (1.22.4-8) ...
Selecting previously unselected package bsdextrautils.
Preparing to unpack .../002-bsdextrautils_2.38.1-1.1_armhf.deb ...
Unpacking bsdextrautils (2.38.1-1.1) ...
Selecting previously unselected package libpipeline1:armhf.
Preparing to unpack .../003-libpipeline1_1.5.6-3_armhf.deb ...
Unpacking libpipeline1:armhf (1.5.6-3) ...
Selecting previously unselected package man-db.
Preparing to unpack .../004-man-db_2.10.2-3_armhf.deb ...
Unpacking man-db (2.10.2-3) ...
Selecting previously unselected package netbase.
Preparing to unpack .../005-netbase_6.3_all.deb ...
Unpacking netbase (6.3) ...
Selecting previously unselected package libncurses6:armhf.
Preparing to unpack .../006-libncurses6_6.3+20220423-2_armhf.deb ...
Unpacking libncurses6:armhf (6.3+20220423-2) ...
Selecting previously unselected package libprocps8:armhf.
Preparing to unpack .../007-libprocps8_2%3a3.3.17-7_armhf.deb ...
Unpacking libprocps8:armhf (2:3.3.17-7) ...
Selecting previously unselected package procps.
Preparing to unpack .../008-procps_2%3a3.3.17-7_armhf.deb ...
Unpacking procps (2:3.3.17-7) ...
Selecting previously unselected package openssl.
Preparing to unpack .../009-openssl_3.0.5-2_armhf.deb ...
Unpacking openssl (3.0.5-2) ...
Selecting previously unselected package ca-certificates.
Preparing to unpack .../010-ca-certificates_20211016_all.deb ...
Unpacking ca-certificates (20211016) ...
Selecting previously unselected package libmagic-mgc.
Preparing to unpack .../011-libmagic-mgc_1%3a5.41-4_armhf.deb ...
Unpacking libmagic-mgc (1:5.41-4) ...
Selecting previously unselected package libmagic1:armhf.
Preparing to unpack .../012-libmagic1_1%3a5.41-4_armhf.deb ...
Unpacking libmagic1:armhf (1:5.41-4) ...
Selecting previously unselected package file.
Preparing to unpack .../013-file_1%3a5.41-4_armhf.deb ...
Unpacking file (1:5.41-4) ...
Selecting previously unselected package gettext-base.
Preparing to unpack .../014-gettext-base_0.21-9_armhf.deb ...
Unpacking gettext-base (0.21-9) ...
Selecting previously unselected package ucf.
Preparing to unpack .../015-ucf_3.0043_all.deb ...
Moving old data out of the way
Unpacking ucf (3.0043) ...
Selecting previously unselected package m4.
Preparing to unpack .../016-m4_1.4.19-1_armhf.deb ...
Unpacking m4 (1.4.19-1) ...
Selecting previously unselected package autoconf.
Preparing to unpack .../017-autoconf_2.71-2_all.deb ...
Unpacking autoconf (2.71-2) ...
Selecting previously unselected package autotools-dev.
Preparing to unpack .../018-autotools-dev_20220109.1_all.deb ...
Unpacking autotools-dev (20220109.1) ...
Selecting previously unselected package automake.
Preparing to unpack .../019-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 .../020-autopoint_0.21-9_all.deb ...
Unpacking autopoint (0.21-9) ...
Selecting previously unselected package libmd0:armhf.
Preparing to unpack .../021-libmd0_1.0.4-2_armhf.deb ...
Unpacking libmd0:armhf (1.0.4-2) ...
Selecting previously unselected package libbsd0:armhf.
Preparing to unpack .../022-libbsd0_0.11.7-1_armhf.deb ...
Unpacking libbsd0:armhf (0.11.7-1) ...
Selecting previously unselected package libedit2:armhf.
Preparing to unpack .../023-libedit2_3.1-20210910-1_armhf.deb ...
Unpacking libedit2:armhf (3.1-20210910-1) ...
Selecting previously unselected package libicu71:armhf.
Preparing to unpack .../024-libicu71_71.1-3_armhf.deb ...
Unpacking libicu71:armhf (71.1-3) ...
Selecting previously unselected package libxml2:armhf.
Preparing to unpack .../025-libxml2_2.9.14+dfsg-1_armhf.deb ...
Unpacking libxml2:armhf (2.9.14+dfsg-1) ...
Selecting previously unselected package libz3-4:armhf.
Preparing to unpack .../026-libz3-4_4.8.12-1_armhf.deb ...
Unpacking libz3-4:armhf (4.8.12-1) ...
Selecting previously unselected package libllvm14:armhf.
Preparing to unpack .../027-libllvm14_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking libllvm14:armhf (1:14.0.6-2+rpi1) ...
Selecting previously unselected package libclang-cpp14.
Preparing to unpack .../028-libclang-cpp14_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking libclang-cpp14 (1:14.0.6-2+rpi1) ...
Selecting previously unselected package gcc-11-base:armhf.
Preparing to unpack .../029-gcc-11-base_11.3.0-8+rpi1_armhf.deb ...
Unpacking gcc-11-base:armhf (11.3.0-8+rpi1) ...
Selecting previously unselected package libasan6:armhf.
Preparing to unpack .../030-libasan6_11.3.0-8+rpi1_armhf.deb ...
Unpacking libasan6:armhf (11.3.0-8+rpi1) ...
Selecting previously unselected package libgcc-11-dev:armhf.
Preparing to unpack .../031-libgcc-11-dev_11.3.0-8+rpi1_armhf.deb ...
Unpacking libgcc-11-dev:armhf (11.3.0-8+rpi1) ...
Selecting previously unselected package libstdc++-11-dev:armhf.
Preparing to unpack .../032-libstdc++-11-dev_11.3.0-8+rpi1_armhf.deb ...
Unpacking libstdc++-11-dev:armhf (11.3.0-8+rpi1) ...
Selecting previously unselected package libgc1:armhf.
Preparing to unpack .../033-libgc1_1%3a8.2.2-3_armhf.deb ...
Unpacking libgc1:armhf (1:8.2.2-3) ...
Selecting previously unselected package libobjc4:armhf.
Preparing to unpack .../034-libobjc4_12.2.0-3+rpi1_armhf.deb ...
Unpacking libobjc4:armhf (12.2.0-3+rpi1) ...
Selecting previously unselected package libobjc-11-dev:armhf.
Preparing to unpack .../035-libobjc-11-dev_11.3.0-8+rpi1_armhf.deb ...
Unpacking libobjc-11-dev:armhf (11.3.0-8+rpi1) ...
Selecting previously unselected package libclang-common-14-dev.
Preparing to unpack .../036-libclang-common-14-dev_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking libclang-common-14-dev (1:14.0.6-2+rpi1) ...
Selecting previously unselected package llvm-14-linker-tools.
Preparing to unpack .../037-llvm-14-linker-tools_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking llvm-14-linker-tools (1:14.0.6-2+rpi1) ...
Selecting previously unselected package libclang1-14.
Preparing to unpack .../038-libclang1-14_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking libclang1-14 (1:14.0.6-2+rpi1) ...
Selecting previously unselected package clang-14.
Preparing to unpack .../039-clang-14_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking clang-14 (1:14.0.6-2+rpi1) ...
Selecting previously unselected package libarchive13:armhf.
Preparing to unpack .../040-libarchive13_3.6.0-1_armhf.deb ...
Unpacking libarchive13:armhf (3.6.0-1) ...
Selecting previously unselected package libbrotli1:armhf.
Preparing to unpack .../041-libbrotli1_1.0.9-2+b2_armhf.deb ...
Unpacking libbrotli1:armhf (1.0.9-2+b2) ...
Selecting previously unselected package libnghttp2-14:armhf.
Preparing to unpack .../042-libnghttp2-14_1.50.0-1_armhf.deb ...
Unpacking libnghttp2-14:armhf (1.50.0-1) ...
Selecting previously unselected package libpsl5:armhf.
Preparing to unpack .../043-libpsl5_0.21.0-1.2_armhf.deb ...
Unpacking libpsl5:armhf (0.21.0-1.2) ...
Selecting previously unselected package librtmp1:armhf.
Preparing to unpack .../044-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 .../045-libssh2-1_1.10.0-3+b1_armhf.deb ...
Unpacking libssh2-1:armhf (1.10.0-3+b1) ...
Selecting previously unselected package libcurl4:armhf.
Preparing to unpack .../046-libcurl4_7.85.0-1_armhf.deb ...
Unpacking libcurl4:armhf (7.85.0-1) ...
Selecting previously unselected package libjsoncpp25:armhf.
Preparing to unpack .../047-libjsoncpp25_1.9.5-4_armhf.deb ...
Unpacking libjsoncpp25:armhf (1.9.5-4) ...
Selecting previously unselected package librhash0:armhf.
Preparing to unpack .../048-librhash0_1.4.3-3_armhf.deb ...
Unpacking librhash0:armhf (1.4.3-3) ...
Selecting previously unselected package libuv1:armhf.
Preparing to unpack .../049-libuv1_1.44.2-1+rpi1_armhf.deb ...
Unpacking libuv1:armhf (1.44.2-1+rpi1) ...
Selecting previously unselected package dh-elpa-helper.
Preparing to unpack .../050-dh-elpa-helper_2.0.14_all.deb ...
Unpacking dh-elpa-helper (2.0.14) ...
Selecting previously unselected package emacsen-common.
Preparing to unpack .../051-emacsen-common_3.0.4_all.deb ...
Unpacking emacsen-common (3.0.4) ...
Selecting previously unselected package cmake-data.
Preparing to unpack .../052-cmake-data_3.24.2-1_all.deb ...
Unpacking cmake-data (3.24.2-1) ...
Selecting previously unselected package cmake.
Preparing to unpack .../053-cmake_3.24.2-1_armhf.deb ...
Unpacking cmake (3.24.2-1) ...
Selecting previously unselected package libdebhelper-perl.
Preparing to unpack .../054-libdebhelper-perl_13.10_all.deb ...
Unpacking libdebhelper-perl (13.10) ...
Selecting previously unselected package libtool.
Preparing to unpack .../055-libtool_2.4.7-4_all.deb ...
Unpacking libtool (2.4.7-4) ...
Selecting previously unselected package dh-autoreconf.
Preparing to unpack .../056-dh-autoreconf_20_all.deb ...
Unpacking dh-autoreconf (20) ...
Selecting previously unselected package libarchive-zip-perl.
Preparing to unpack .../057-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 .../058-libsub-override-perl_0.09-3_all.deb ...
Unpacking libsub-override-perl (0.09-3) ...
Selecting previously unselected package libfile-stripnondeterminism-perl.
Preparing to unpack .../059-libfile-stripnondeterminism-perl_1.13.0-1_all.deb ...
Unpacking libfile-stripnondeterminism-perl (1.13.0-1) ...
Selecting previously unselected package dh-strip-nondeterminism.
Preparing to unpack .../060-dh-strip-nondeterminism_1.13.0-1_all.deb ...
Unpacking dh-strip-nondeterminism (1.13.0-1) ...
Selecting previously unselected package libelf1:armhf.
Preparing to unpack .../061-libelf1_0.187-2+rpi2_armhf.deb ...
Unpacking libelf1:armhf (0.187-2+rpi2) ...
Selecting previously unselected package dwz.
Preparing to unpack .../062-dwz_0.14+20220924-2_armhf.deb ...
Unpacking dwz (0.14+20220924-2) ...
Selecting previously unselected package gettext.
Preparing to unpack .../063-gettext_0.21-9_armhf.deb ...
Unpacking gettext (0.21-9) ...
Selecting previously unselected package intltool-debian.
Preparing to unpack .../064-intltool-debian_0.35.0+20060710.5_all.deb ...
Unpacking intltool-debian (0.35.0+20060710.5) ...
Selecting previously unselected package po-debconf.
Preparing to unpack .../065-po-debconf_1.0.21+nmu1_all.deb ...
Unpacking po-debconf (1.0.21+nmu1) ...
Selecting previously unselected package debhelper.
Preparing to unpack .../066-debhelper_13.10_all.deb ...
Unpacking debhelper (13.10) ...
Selecting previously unselected package xml-core.
Preparing to unpack .../067-xml-core_0.18+nmu1_all.deb ...
Unpacking xml-core (0.18+nmu1) ...
Selecting previously unselected package docutils-common.
Preparing to unpack .../068-docutils-common_0.17.1+dfsg-2_all.deb ...
Unpacking docutils-common (0.17.1+dfsg-2) ...
Selecting previously unselected package libpng16-16:armhf.
Preparing to unpack .../069-libpng16-16_1.6.38-2_armhf.deb ...
Unpacking libpng16-16:armhf (1.6.38-2) ...
Selecting previously unselected package libfreetype6:armhf.
Preparing to unpack .../070-libfreetype6_2.12.1+dfsg-3_armhf.deb ...
Unpacking libfreetype6:armhf (2.12.1+dfsg-3) ...
Selecting previously unselected package fonts-dejavu-core.
Preparing to unpack .../071-fonts-dejavu-core_2.37-2_all.deb ...
Unpacking fonts-dejavu-core (2.37-2) ...
Selecting previously unselected package fontconfig-config.
Preparing to unpack .../072-fontconfig-config_2.13.1-4.5_armhf.deb ...
Unpacking fontconfig-config (2.13.1-4.5) ...
Selecting previously unselected package libfontconfig1:armhf.
Preparing to unpack .../073-libfontconfig1_2.13.1-4.5_armhf.deb ...
Unpacking libfontconfig1:armhf (2.13.1-4.5) ...
Selecting previously unselected package fontconfig.
Preparing to unpack .../074-fontconfig_2.13.1-4.5_armhf.deb ...
Unpacking fontconfig (2.13.1-4.5) ...
Selecting previously unselected package fonts-mathjax.
Preparing to unpack .../075-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 .../076-gdal-data_3.5.2+dfsg-1_all.deb ...
Unpacking gdal-data (3.5.2+dfsg-1) ...
Selecting previously unselected package gdal-plugins.
Preparing to unpack .../077-gdal-plugins_3.5.2+dfsg-1_armhf.deb ...
Unpacking gdal-plugins (3.5.2+dfsg-1) ...
Selecting previously unselected package libcdt5:armhf.
Preparing to unpack .../078-libcdt5_2.42.2-7_armhf.deb ...
Unpacking libcdt5:armhf (2.42.2-7) ...
Selecting previously unselected package libcgraph6:armhf.
Preparing to unpack .../079-libcgraph6_2.42.2-7_armhf.deb ...
Unpacking libcgraph6:armhf (2.42.2-7) ...
Selecting previously unselected package libjpeg62-turbo:armhf.
Preparing to unpack .../080-libjpeg62-turbo_1%3a2.1.2-1_armhf.deb ...
Unpacking libjpeg62-turbo:armhf (1:2.1.2-1) ...
Selecting previously unselected package libdeflate0:armhf.
Preparing to unpack .../081-libdeflate0_1.14-1_armhf.deb ...
Unpacking libdeflate0:armhf (1.14-1) ...
Selecting previously unselected package libjbig0:armhf.
Preparing to unpack .../082-libjbig0_2.1-3.1+b2_armhf.deb ...
Unpacking libjbig0:armhf (2.1-3.1+b2) ...
Selecting previously unselected package liblerc4:armhf.
Preparing to unpack .../083-liblerc4_4.0.0+ds-1_armhf.deb ...
Unpacking liblerc4:armhf (4.0.0+ds-1) ...
Selecting previously unselected package libwebp7:armhf.
Preparing to unpack .../084-libwebp7_1.2.2-2_armhf.deb ...
Unpacking libwebp7:armhf (1.2.2-2) ...
Selecting previously unselected package libtiff5:armhf.
Preparing to unpack .../085-libtiff5_4.4.0-4_armhf.deb ...
Unpacking libtiff5:armhf (4.4.0-4) ...
Selecting previously unselected package libxau6:armhf.
Preparing to unpack .../086-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 .../087-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 .../088-libxcb1_1.15-1_armhf.deb ...
Unpacking libxcb1:armhf (1.15-1) ...
Selecting previously unselected package libx11-data.
Preparing to unpack .../089-libx11-data_2%3a1.8.1-2_all.deb ...
Unpacking libx11-data (2:1.8.1-2) ...
Selecting previously unselected package libx11-6:armhf.
Preparing to unpack .../090-libx11-6_2%3a1.8.1-2_armhf.deb ...
Unpacking libx11-6:armhf (2:1.8.1-2) ...
Selecting previously unselected package libxpm4:armhf.
Preparing to unpack .../091-libxpm4_1%3a3.5.12-1_armhf.deb ...
Unpacking libxpm4:armhf (1:3.5.12-1) ...
Selecting previously unselected package libgd3:armhf.
Preparing to unpack .../092-libgd3_2.3.3-6+b3_armhf.deb ...
Unpacking libgd3:armhf (2.3.3-6+b3) ...
Selecting previously unselected package libglib2.0-0:armhf.
Preparing to unpack .../093-libglib2.0-0_2.74.0-2_armhf.deb ...
Unpacking libglib2.0-0:armhf (2.74.0-2) ...
Selecting previously unselected package libgts-0.7-5:armhf.
Preparing to unpack .../094-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 .../095-libpixman-1-0_0.40.0-1_armhf.deb ...
Unpacking libpixman-1-0:armhf (0.40.0-1) ...
Selecting previously unselected package libxcb-render0:armhf.
Preparing to unpack .../096-libxcb-render0_1.15-1_armhf.deb ...
Unpacking libxcb-render0:armhf (1.15-1) ...
Selecting previously unselected package libxcb-shm0:armhf.
Preparing to unpack .../097-libxcb-shm0_1.15-1_armhf.deb ...
Unpacking libxcb-shm0:armhf (1.15-1) ...
Selecting previously unselected package libxext6:armhf.
Preparing to unpack .../098-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 .../099-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 .../100-libcairo2_1.16.0-6_armhf.deb ...
Unpacking libcairo2:armhf (1.16.0-6) ...
Selecting previously unselected package libltdl7:armhf.
Preparing to unpack .../101-libltdl7_2.4.7-4_armhf.deb ...
Unpacking libltdl7:armhf (2.4.7-4) ...
Selecting previously unselected package libfribidi0:armhf.
Preparing to unpack .../102-libfribidi0_1.0.8-2.1_armhf.deb ...
Unpacking libfribidi0:armhf (1.0.8-2.1) ...
Selecting previously unselected package libgraphite2-3:armhf.
Preparing to unpack .../103-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 .../104-libharfbuzz0b_5.2.0-2_armhf.deb ...
Unpacking libharfbuzz0b:armhf (5.2.0-2) ...
Selecting previously unselected package libthai-data.
Preparing to unpack .../105-libthai-data_0.1.29-1_all.deb ...
Unpacking libthai-data (0.1.29-1) ...
Selecting previously unselected package libdatrie1:armhf.
Preparing to unpack .../106-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 .../107-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 .../108-libpango-1.0-0_1.50.10+ds-1_armhf.deb ...
Unpacking libpango-1.0-0:armhf (1.50.10+ds-1) ...
Selecting previously unselected package libpangoft2-1.0-0:armhf.
Preparing to unpack .../109-libpangoft2-1.0-0_1.50.10+ds-1_armhf.deb ...
Unpacking libpangoft2-1.0-0:armhf (1.50.10+ds-1) ...
Selecting previously unselected package libpangocairo-1.0-0:armhf.
Preparing to unpack .../110-libpangocairo-1.0-0_1.50.10+ds-1_armhf.deb ...
Unpacking libpangocairo-1.0-0:armhf (1.50.10+ds-1) ...
Selecting previously unselected package libpathplan4:armhf.
Preparing to unpack .../111-libpathplan4_2.42.2-7_armhf.deb ...
Unpacking libpathplan4:armhf (2.42.2-7) ...
Selecting previously unselected package libgvc6.
Preparing to unpack .../112-libgvc6_2.42.2-7_armhf.deb ...
Unpacking libgvc6 (2.42.2-7) ...
Selecting previously unselected package libgvpr2:armhf.
Preparing to unpack .../113-libgvpr2_2.42.2-7_armhf.deb ...
Unpacking libgvpr2:armhf (2.42.2-7) ...
Selecting previously unselected package liblab-gamut1:armhf.
Preparing to unpack .../114-liblab-gamut1_2.42.2-7_armhf.deb ...
Unpacking liblab-gamut1:armhf (2.42.2-7) ...
Selecting previously unselected package x11-common.
Preparing to unpack .../115-x11-common_1%3a7.7+23_all.deb ...
Unpacking x11-common (1:7.7+23) ...
Selecting previously unselected package libice6:armhf.
Preparing to unpack .../116-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 .../117-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 .../118-libxt6_1%3a1.2.1-1_armhf.deb ...
Unpacking libxt6:armhf (1:1.2.1-1) ...
Selecting previously unselected package libxmu6:armhf.
Preparing to unpack .../119-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 .../120-libxaw7_2%3a1.0.14-1_armhf.deb ...
Unpacking libxaw7:armhf (2:1.0.14-1) ...
Selecting previously unselected package graphviz.
Preparing to unpack .../121-graphviz_2.42.2-7_armhf.deb ...
Unpacking graphviz (2.42.2-7) ...
Selecting previously unselected package icu-devtools.
Preparing to unpack .../122-icu-devtools_71.1-3_armhf.deb ...
Unpacking icu-devtools (71.1-3) ...
Selecting previously unselected package libaec0:armhf.
Preparing to unpack .../123-libaec0_1.0.6-1_armhf.deb ...
Unpacking libaec0:armhf (1.0.6-1) ...
Selecting previously unselected package libaom3:armhf.
Preparing to unpack .../124-libaom3_3.5.0-1_armhf.deb ...
Unpacking libaom3:armhf (3.5.0-1) ...
Selecting previously unselected package libblas3:armhf.
Preparing to unpack .../125-libblas3_3.10.1-2_armhf.deb ...
Unpacking libblas3:armhf (3.10.1-2) ...
Selecting previously unselected package libgfortran5:armhf.
Preparing to unpack .../126-libgfortran5_12.2.0-3+rpi1_armhf.deb ...
Unpacking libgfortran5:armhf (12.2.0-3+rpi1) ...
Selecting previously unselected package liblapack3:armhf.
Preparing to unpack .../127-liblapack3_3.10.1-2_armhf.deb ...
Unpacking liblapack3:armhf (3.10.1-2) ...
Selecting previously unselected package libarpack2:armhf.
Preparing to unpack .../128-libarpack2_3.8.0-1_armhf.deb ...
Unpacking libarpack2:armhf (3.8.0-1) ...
Selecting previously unselected package libsuperlu5:armhf.
Preparing to unpack .../129-libsuperlu5_5.3.0+dfsg1-2_armhf.deb ...
Unpacking libsuperlu5:armhf (5.3.0+dfsg1-2) ...
Selecting previously unselected package libarmadillo11.
Preparing to unpack .../130-libarmadillo11_1%3a11.2.3+dfsg-1_armhf.deb ...
Unpacking libarmadillo11 (1:11.2.3+dfsg-1) ...
Selecting previously unselected package libsnappy1v5:armhf.
Preparing to unpack .../131-libsnappy1v5_1.1.9-2_armhf.deb ...
Unpacking libsnappy1v5:armhf (1.1.9-2) ...
Selecting previously unselected package libblosc1:armhf.
Preparing to unpack .../132-libblosc1_1.21.1+ds2-3_armhf.deb ...
Unpacking libblosc1:armhf (1.21.1+ds2-3) ...
Selecting previously unselected package libboost1.74-dev:armhf.
Preparing to unpack .../133-libboost1.74-dev_1.74.0-17_armhf.deb ...
Unpacking libboost1.74-dev:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-regex1.74.0:armhf.
Preparing to unpack .../134-libboost-regex1.74.0_1.74.0-17_armhf.deb ...
Unpacking libboost-regex1.74.0:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-graph1.74.0:armhf.
Preparing to unpack .../135-libboost-graph1.74.0_1.74.0-17_armhf.deb ...
Unpacking libboost-graph1.74.0:armhf (1.74.0-17) ...
Selecting previously unselected package libicu-dev:armhf.
Preparing to unpack .../136-libicu-dev_71.1-3_armhf.deb ...
Unpacking libicu-dev:armhf (71.1-3) ...
Selecting previously unselected package libboost-regex1.74-dev:armhf.
Preparing to unpack .../137-libboost-regex1.74-dev_1.74.0-17_armhf.deb ...
Unpacking libboost-regex1.74-dev:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-serialization1.74.0:armhf.
Preparing to unpack .../138-libboost-serialization1.74.0_1.74.0-17_armhf.deb ...
Unpacking libboost-serialization1.74.0:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-serialization1.74-dev:armhf.
Preparing to unpack .../139-libboost-serialization1.74-dev_1.74.0-17_armhf.deb ...
Unpacking libboost-serialization1.74-dev:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-test1.74.0:armhf.
Preparing to unpack .../140-libboost-test1.74.0_1.74.0-17_armhf.deb ...
Unpacking libboost-test1.74.0:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-test1.74-dev:armhf.
Preparing to unpack .../141-libboost-test1.74-dev_1.74.0-17_armhf.deb ...
Unpacking libboost-test1.74-dev:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-graph1.74-dev:armhf.
Preparing to unpack .../142-libboost-graph1.74-dev_1.74.0-17_armhf.deb ...
Unpacking libboost-graph1.74-dev:armhf (1.74.0-17) ...
Selecting previously unselected package libboost-graph-dev:armhf.
Preparing to unpack .../143-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 .../144-libcurl3-gnutls_7.85.0-1_armhf.deb ...
Unpacking libcurl3-gnutls:armhf (7.85.0-1) ...
Selecting previously unselected package libcfitsio9:armhf.
Preparing to unpack .../145-libcfitsio9_4.1.0-1_armhf.deb ...
Unpacking libcfitsio9:armhf (4.1.0-1) ...
Selecting previously unselected package libnspr4:armhf.
Preparing to unpack .../146-libnspr4_2%3a4.35-1_armhf.deb ...
Unpacking libnspr4:armhf (2:4.35-1) ...
Selecting previously unselected package libnss3:armhf.
Preparing to unpack .../147-libnss3_2%3a3.83-1_armhf.deb ...
Unpacking libnss3:armhf (2:3.83-1) ...
Selecting previously unselected package libcurl3-nss:armhf.
Preparing to unpack .../148-libcurl3-nss_7.85.0-1_armhf.deb ...
Unpacking libcurl3-nss:armhf (7.85.0-1) ...
Selecting previously unselected package libdav1d6:armhf.
Preparing to unpack .../149-libdav1d6_1.0.0-2+rpi1_armhf.deb ...
Unpacking libdav1d6:armhf (1.0.0-2+rpi1) ...
Selecting previously unselected package libde265-0:armhf.
Preparing to unpack .../150-libde265-0_1.0.8-1+rpi1+b1_armhf.deb ...
Unpacking libde265-0:armhf (1.0.8-1+rpi1+b1) ...
Selecting previously unselected package libffi-dev:armhf.
Preparing to unpack .../151-libffi-dev_3.4.2-4_armhf.deb ...
Unpacking libffi-dev:armhf (3.4.2-4) ...
Selecting previously unselected package libfreexl1:armhf.
Preparing to unpack .../152-libfreexl1_1.0.6-1_armhf.deb ...
Unpacking libfreexl1:armhf (1.0.6-1) ...
Selecting previously unselected package libfyba0:armhf.
Preparing to unpack .../153-libfyba0_4.1.1-7_armhf.deb ...
Unpacking libfyba0:armhf (4.1.1-7) ...
Selecting previously unselected package libgeos3.11.0:armhf.
Preparing to unpack .../154-libgeos3.11.0_3.11.0-2_armhf.deb ...
Unpacking libgeos3.11.0:armhf (3.11.0-2) ...
Selecting previously unselected package libgeos-c1v5:armhf.
Preparing to unpack .../155-libgeos-c1v5_3.11.0-2_armhf.deb ...
Unpacking libgeos-c1v5:armhf (3.11.0-2) ...
Selecting previously unselected package proj-data.
Preparing to unpack .../156-proj-data_9.1.0-1_all.deb ...
Unpacking proj-data (9.1.0-1) ...
Selecting previously unselected package libproj25:armhf.
Preparing to unpack .../157-libproj25_9.1.0-1_armhf.deb ...
Unpacking libproj25:armhf (9.1.0-1) ...
Selecting previously unselected package libgeotiff5:armhf.
Preparing to unpack .../158-libgeotiff5_1.7.1-1+b1_armhf.deb ...
Unpacking libgeotiff5:armhf (1.7.1-1+b1) ...
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.15-4_armhf.deb ...
Unpacking libhdf4-0-alt (4.2.15-4) ...
Selecting previously unselected package libsz2:armhf.
Preparing to unpack .../161-libsz2_1.0.6-1_armhf.deb ...
Unpacking libsz2:armhf (1.0.6-1) ...
Selecting previously unselected package libhdf5-103-1:armhf.
Preparing to unpack .../162-libhdf5-103-1_1.10.8+repack-1_armhf.deb ...
Unpacking libhdf5-103-1:armhf (1.10.8+repack-1) ...
Selecting previously unselected package libx265-199:armhf.
Preparing to unpack .../163-libx265-199_3.5-2_armhf.deb ...
Unpacking libx265-199:armhf (3.5-2) ...
Selecting previously unselected package libheif1:armhf.
Preparing to unpack .../164-libheif1_1.13.0-1_armhf.deb ...
Unpacking libheif1:armhf (1.13.0-1) ...
Selecting previously unselected package libjson-c5:armhf.
Preparing to unpack .../165-libjson-c5_0.16-2_armhf.deb ...
Unpacking libjson-c5:armhf (0.16-2) ...
Selecting previously unselected package libminizip1:armhf.
Preparing to unpack .../166-libminizip1_1.1-8+b1_armhf.deb ...
Unpacking libminizip1:armhf (1.1-8+b1) ...
Selecting previously unselected package liburiparser1:armhf.
Preparing to unpack .../167-liburiparser1_0.9.6+dfsg-1_armhf.deb ...
Unpacking liburiparser1:armhf (0.9.6+dfsg-1) ...
Selecting previously unselected package libkmlbase1:armhf.
Preparing to unpack .../168-libkmlbase1_1.3.0-9_armhf.deb ...
Unpacking libkmlbase1:armhf (1.3.0-9) ...
Selecting previously unselected package libkmldom1:armhf.
Preparing to unpack .../169-libkmldom1_1.3.0-9_armhf.deb ...
Unpacking libkmldom1:armhf (1.3.0-9) ...
Selecting previously unselected package libkmlengine1:armhf.
Preparing to unpack .../170-libkmlengine1_1.3.0-9_armhf.deb ...
Unpacking libkmlengine1:armhf (1.3.0-9) ...
Selecting previously unselected package mysql-common.
Preparing to unpack .../171-mysql-common_5.8+1.0.8_all.deb ...
Unpacking mysql-common (5.8+1.0.8) ...
Selecting previously unselected package mariadb-common.
Preparing to unpack .../172-mariadb-common_1%3a10.6.10-1_all.deb ...
Unpacking mariadb-common (1:10.6.10-1) ...
Selecting previously unselected package libmariadb3:armhf.
Preparing to unpack .../173-libmariadb3_1%3a10.6.10-1_armhf.deb ...
Unpacking libmariadb3:armhf (1:10.6.10-1) ...
Selecting previously unselected package libhdf5-hl-100:armhf.
Preparing to unpack .../174-libhdf5-hl-100_1.10.8+repack-1_armhf.deb ...
Unpacking libhdf5-hl-100:armhf (1.10.8+repack-1) ...
Selecting previously unselected package libnetcdf19:armhf.
Preparing to unpack .../175-libnetcdf19_1%3a4.9.0-3+b2_armhf.deb ...
Unpacking libnetcdf19:armhf (1:4.9.0-3+b2) ...
Selecting previously unselected package libodbc2:armhf.
Preparing to unpack .../176-libodbc2_2.3.11-2_armhf.deb ...
Unpacking libodbc2:armhf (2.3.11-2) ...
Selecting previously unselected package unixodbc-common.
Preparing to unpack .../177-unixodbc-common_2.3.11-2_all.deb ...
Unpacking unixodbc-common (2.3.11-2) ...
Selecting previously unselected package libodbcinst2:armhf.
Preparing to unpack .../178-libodbcinst2_2.3.11-2_armhf.deb ...
Unpacking libodbcinst2:armhf (2.3.11-2) ...
Selecting previously unselected package libogdi4.1.
Preparing to unpack .../179-libogdi4.1_4.1.0+ds-5+b1_armhf.deb ...
Unpacking libogdi4.1 (4.1.0+ds-5+b1) ...
Selecting previously unselected package libopenjp2-7:armhf.
Preparing to unpack .../180-libopenjp2-7_2.5.0-1_armhf.deb ...
Unpacking libopenjp2-7:armhf (2.5.0-1) ...
Selecting previously unselected package liblcms2-2:armhf.
Preparing to unpack .../181-liblcms2-2_2.13.1-1_armhf.deb ...
Unpacking liblcms2-2:armhf (2.13.1-1) ...
Selecting previously unselected package libpoppler123:armhf.
Preparing to unpack .../182-libpoppler123_22.08.0-2.1_armhf.deb ...
Unpacking libpoppler123:armhf (22.08.0-2.1) ...
Selecting previously unselected package libpq5:armhf.
Preparing to unpack .../183-libpq5_15~rc2-1_armhf.deb ...
Unpacking libpq5:armhf (15~rc2-1) ...
Selecting previously unselected package libqhull-r8.0:armhf.
Preparing to unpack .../184-libqhull-r8.0_2020.2-5_armhf.deb ...
Unpacking libqhull-r8.0:armhf (2020.2-5) ...
Selecting previously unselected package librttopo1:armhf.
Preparing to unpack .../185-librttopo1_1.1.0-2_armhf.deb ...
Unpacking librttopo1:armhf (1.1.0-2) ...
Selecting previously unselected package libspatialite7:armhf.
Preparing to unpack .../186-libspatialite7_5.0.1-2+b2_armhf.deb ...
Unpacking libspatialite7:armhf (5.0.1-2+b2) ...
Selecting previously unselected package libxerces-c3.2:armhf.
Preparing to unpack .../187-libxerces-c3.2_3.2.3+debian-3+b1_armhf.deb ...
Unpacking libxerces-c3.2:armhf (3.2.3+debian-3+b1) ...
Selecting previously unselected package libgdal31.
Preparing to unpack .../188-libgdal31_3.5.2+dfsg-1_armhf.deb ...
Unpacking libgdal31 (3.5.2+dfsg-1) ...
Selecting previously unselected package libjs-jquery.
Preparing to unpack .../189-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 .../190-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 .../191-libjs-underscore_1.13.4~dfsg+~1.11.4-1_all.deb ...
Unpacking libjs-underscore (1.13.4~dfsg+~1.11.4-1) ...
Selecting previously unselected package libjs-sphinxdoc.
Preparing to unpack .../192-libjs-sphinxdoc_4.5.0-4_all.deb ...
Unpacking libjs-sphinxdoc (4.5.0-4) ...
Selecting previously unselected package libjson-perl.
Preparing to unpack .../193-libjson-perl_4.10000-1_all.deb ...
Unpacking libjson-perl (4.10000-1) ...
Selecting previously unselected package libncurses-dev:armhf.
Preparing to unpack .../194-libncurses-dev_6.3+20220423-2_armhf.deb ...
Unpacking libncurses-dev:armhf (6.3+20220423-2) ...
Selecting previously unselected package libpfm4:armhf.
Preparing to unpack .../195-libpfm4_4.12.0-1_armhf.deb ...
Unpacking libpfm4:armhf (4.12.0-1) ...
Selecting previously unselected package libssl-dev:armhf.
Preparing to unpack .../196-libssl-dev_3.0.5-2_armhf.deb ...
Unpacking libssl-dev:armhf (3.0.5-2) ...
Selecting previously unselected package libpq-dev.
Preparing to unpack .../197-libpq-dev_15~rc2-1_armhf.deb ...
Unpacking libpq-dev (15~rc2-1) ...
Selecting previously unselected package libtinfo-dev:armhf.
Preparing to unpack .../198-libtinfo-dev_6.3+20220423-2_armhf.deb ...
Unpacking libtinfo-dev:armhf (6.3+20220423-2) ...
Selecting previously unselected package libxml2-dev:armhf.
Preparing to unpack .../199-libxml2-dev_2.9.14+dfsg-1_armhf.deb ...
Unpacking libxml2-dev:armhf (2.9.14+dfsg-1) ...
Selecting previously unselected package libyaml-0-2:armhf.
Preparing to unpack .../200-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 .../201-libz3-dev_4.8.12-1_armhf.deb ...
Unpacking libz3-dev:armhf (4.8.12-1) ...
Selecting previously unselected package llvm-14-runtime.
Preparing to unpack .../202-llvm-14-runtime_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking llvm-14-runtime (1:14.0.6-2+rpi1) ...
Selecting previously unselected package llvm-14.
Preparing to unpack .../203-llvm-14_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking llvm-14 (1:14.0.6-2+rpi1) ...
Selecting previously unselected package python3-pkg-resources.
Preparing to unpack .../204-python3-pkg-resources_59.6.0-1.2_all.deb ...
Unpacking python3-pkg-resources (59.6.0-1.2) ...
Selecting previously unselected package python3-pygments.
Preparing to unpack .../205-python3-pygments_2.12.0+dfsg-2_all.deb ...
Unpacking python3-pygments (2.12.0+dfsg-2) ...
Selecting previously unselected package python3-yaml.
Preparing to unpack .../206-python3-yaml_5.4.1-1+b1_armhf.deb ...
Unpacking python3-yaml (5.4.1-1+b1) ...
Selecting previously unselected package llvm-14-tools.
Preparing to unpack .../207-llvm-14-tools_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking llvm-14-tools (1:14.0.6-2+rpi1) ...
Selecting previously unselected package llvm-14-dev.
Preparing to unpack .../208-llvm-14-dev_1%3a14.0.6-2+rpi1_armhf.deb ...
Unpacking llvm-14-dev (1:14.0.6-2+rpi1) ...
Selecting previously unselected package postgis.
Preparing to unpack .../209-postgis_3.3.1+dfsg-1_armhf.deb ...
Unpacking postgis (3.3.1+dfsg-1) ...
Selecting previously unselected package postgresql-client-common.
Preparing to unpack .../210-postgresql-client-common_243_all.deb ...
Unpacking postgresql-client-common (243) ...
Selecting previously unselected package postgresql-client-14.
Preparing to unpack .../211-postgresql-client-14_14.5-2_armhf.deb ...
Unpacking postgresql-client-14 (14.5-2) ...
Selecting previously unselected package ssl-cert.
Preparing to unpack .../212-ssl-cert_1.1.2_all.deb ...
Unpacking ssl-cert (1.1.2) ...
Selecting previously unselected package postgresql-common.
Preparing to unpack .../213-postgresql-common_243_all.deb ...
Adding 'diversion of /usr/bin/pg_config to /usr/bin/pg_config.libpq-dev by postgresql-common'
Unpacking postgresql-common (243) ...
Selecting previously unselected package postgresql-server-dev-14.
Preparing to unpack .../214-postgresql-server-dev-14_14.5-2_armhf.deb ...
Unpacking postgresql-server-dev-14 (14.5-2) ...
Selecting previously unselected package postgresql-server-dev-all:armhf.
Preparing to unpack .../215-postgresql-server-dev-all_243_armhf.deb ...
Unpacking postgresql-server-dev-all:armhf (243) ...
Selecting previously unselected package python-babel-localedata.
Preparing to unpack .../216-python-babel-localedata_2.10.3-1_all.deb ...
Unpacking python-babel-localedata (2.10.3-1) ...
Selecting previously unselected package python3-alabaster.
Preparing to unpack .../217-python3-alabaster_0.7.12-1_all.deb ...
Unpacking python3-alabaster (0.7.12-1) ...
Selecting previously unselected package python3-tz.
Preparing to unpack .../218-python3-tz_2022.4-1_all.deb ...
Unpacking python3-tz (2022.4-1) ...
Selecting previously unselected package python3-babel.
Preparing to unpack .../219-python3-babel_2.10.3-1_all.deb ...
Unpacking python3-babel (2.10.3-1) ...
Selecting previously unselected package python3-certifi.
Preparing to unpack .../220-python3-certifi_2022.6.15-2_all.deb ...
Unpacking python3-certifi (2022.6.15-2) ...
Selecting previously unselected package python3-chardet.
Preparing to unpack .../221-python3-chardet_4.0.0-2_all.deb ...
Unpacking python3-chardet (4.0.0-2) ...
Selecting previously unselected package python3-charset-normalizer.
Preparing to unpack .../222-python3-charset-normalizer_2.0.6-2_all.deb ...
Unpacking python3-charset-normalizer (2.0.6-2) ...
Selecting previously unselected package python3-lib2to3.
Preparing to unpack .../223-python3-lib2to3_3.10.7-1_all.deb ...
Unpacking python3-lib2to3 (3.10.7-1) ...
Selecting previously unselected package python3-distutils.
Preparing to unpack .../224-python3-distutils_3.10.7-1_all.deb ...
Unpacking python3-distutils (3.10.7-1) ...
Selecting previously unselected package python3-roman.
Preparing to unpack .../225-python3-roman_3.3-1_all.deb ...
Unpacking python3-roman (3.3-1) ...
Selecting previously unselected package python3-docutils.
Preparing to unpack .../226-python3-docutils_0.17.1+dfsg-2_all.deb ...
Unpacking python3-docutils (0.17.1+dfsg-2) ...
Selecting previously unselected package python3-idna.
Preparing to unpack .../227-python3-idna_3.3-1_all.deb ...
Unpacking python3-idna (3.3-1) ...
Selecting previously unselected package python3-imagesize.
Preparing to unpack .../228-python3-imagesize_1.4.1-1_all.deb ...
Unpacking python3-imagesize (1.4.1-1) ...
Selecting previously unselected package python3-more-itertools.
Preparing to unpack .../229-python3-more-itertools_8.10.0-2_all.deb ...
Unpacking python3-more-itertools (8.10.0-2) ...
Selecting previously unselected package python3-zipp.
Preparing to unpack .../230-python3-zipp_1.0.0-4_all.deb ...
Unpacking python3-zipp (1.0.0-4) ...
Selecting previously unselected package python3-importlib-metadata.
Preparing to unpack .../231-python3-importlib-metadata_4.12.0-1_all.deb ...
Unpacking python3-importlib-metadata (4.12.0-1) ...
Selecting previously unselected package python3-markupsafe.
Preparing to unpack .../232-python3-markupsafe_2.1.1-1_armhf.deb ...
Unpacking python3-markupsafe (2.1.1-1) ...
Selecting previously unselected package python3-jinja2.
Preparing to unpack .../233-python3-jinja2_3.0.3-2_all.deb ...
Unpacking python3-jinja2 (3.0.3-2) ...
Selecting previously unselected package python3-pyparsing.
Preparing to unpack .../234-python3-pyparsing_3.0.7-2_all.deb ...
Unpacking python3-pyparsing (3.0.7-2) ...
Selecting previously unselected package python3-packaging.
Preparing to unpack .../235-python3-packaging_21.3-1.1_all.deb ...
Unpacking python3-packaging (21.3-1.1) ...
Selecting previously unselected package python3-six.
Preparing to unpack .../236-python3-six_1.16.0-4_all.deb ...
Unpacking python3-six (1.16.0-4) ...
Selecting previously unselected package python3-urllib3.
Preparing to unpack .../237-python3-urllib3_1.26.12-1_all.deb ...
Unpacking python3-urllib3 (1.26.12-1) ...
Selecting previously unselected package python3-requests.
Preparing to unpack .../238-python3-requests_2.27.1+dfsg-1_all.deb ...
Unpacking python3-requests (2.27.1+dfsg-1) ...
Selecting previously unselected package python3-snowballstemmer.
Preparing to unpack .../239-python3-snowballstemmer_2.2.0-1_all.deb ...
Unpacking python3-snowballstemmer (2.2.0-1) ...
Selecting previously unselected package sphinx-common.
Preparing to unpack .../240-sphinx-common_4.5.0-4_all.deb ...
Unpacking sphinx-common (4.5.0-4) ...
Selecting previously unselected package python3-sphinx.
Preparing to unpack .../241-python3-sphinx_4.5.0-4_all.deb ...
Unpacking python3-sphinx (4.5.0-4) ...
Selecting previously unselected package rdfind.
Preparing to unpack .../242-rdfind_1.5.0-1.1_armhf.deb ...
Unpacking rdfind (1.5.0-1.1) ...
Selecting previously unselected package sbuild-build-depends-main-dummy.
Preparing to unpack .../243-sbuild-build-depends-main-dummy_0.invalid.0_armhf.deb ...
Unpacking sbuild-build-depends-main-dummy (0.invalid.0) ...
Setting up media-types (8.0.0) ...
Setting up libpipeline1:armhf (1.5.6-3) ...
Setting up libgraphite2-3:armhf (1.3.14-1) ...
Setting up liblcms2-2:armhf (2.13.1-1) ...
Setting up libpixman-1-0:armhf (0.40.0-1) ...
Setting up libicu71:armhf (71.1-3) ...
Setting up gcc-11-base:armhf (11.3.0-8+rpi1) ...
Setting up libaom3:armhf (3.5.0-1) ...
Setting up mysql-common (5.8+1.0.8) ...
update-alternatives: using /etc/mysql/my.cnf.fallback to provide /etc/mysql/my.cnf (my.cnf) in auto mode
Setting up libxau6:armhf (1:1.0.9-1) ...
Setting up libpsl5:armhf (0.21.0-1.2) ...
Setting up libboost1.74-dev:armhf (1.74.0-17) ...
Setting up fonts-mathjax (2.7.9+dfsg-1) ...
Setting up liblerc4:armhf (4.0.0+ds-1) ...
Setting up proj-data (9.1.0-1) ...
Setting up bsdextrautils (2.38.1-1.1) ...
Setting up libjs-mathjax (2.7.9+dfsg-1) ...
Setting up libdatrie1:armhf (0.2.13-2+b2) ...
Setting up libmagic-mgc (1:5.41-4) ...
Setting up libogdi4.1 (4.1.0+ds-5+b1) ...
Setting up libminizip1:armhf (1.1-8+b1) ...
Setting up libgeos3.11.0:armhf (3.11.0-2) ...
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.74.0-2) ...
No schema files found: doing nothing.
Setting up libdebhelper-perl (13.10) ...
Setting up libbrotli1:armhf (1.0.9-2+b2) ...
Setting up rdfind (1.5.0-1.1) ...
Setting up liblab-gamut1:armhf (2.42.2-7) ...
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.50.0-1) ...
Setting up libmagic1:armhf (1:5.41-4) ...
Setting up libpq5:armhf (15~rc2-1) ...
Setting up libdeflate0:armhf (1.14-1) ...
Setting up gettext-base (0.21-9) ...
Setting up m4 (1.4.19-1) ...
Setting up libqhull-r8.0:armhf (2020.2-5) ...
Setting up file (1:5.41-4) ...
Setting up libffi-dev:armhf (3.4.2-4) ...
Setting up libjbig0:armhf (2.1-3.1+b2) ...
Setting up libaec0:armhf (1.0.6-1) ...
Setting up gdal-data (3.5.2+dfsg-1) ...
Setting up python-babel-localedata (2.10.3-1) ...
Setting up libasan6:armhf (11.3.0-8+rpi1) ...
Setting up libsnappy1v5:armhf (1.1.9-2) ...
Setting up libgts-0.7-5:armhf (0.7.6+darcs121130-5) ...
Setting up mariadb-common (1:10.6.10-1) ...
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-1) ...
Setting up libblas3:armhf (3.10.1-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.44.2-1+rpi1) ...
Setting up libpfm4:armhf (4.12.0-1) ...
Setting up libboost-test1.74.0:armhf (1.74.0-17) ...
Setting up libjpeg62-turbo:armhf (1:2.1.2-1) ...
Setting up emacsen-common (3.0.4) ...
Setting up libx11-data (2:1.8.1-2) ...
Setting up libnspr4:armhf (2:4.35-1) ...
Setting up librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b2) ...
Setting up dh-elpa-helper (2.0.14) ...
Setting up libpathplan4:armhf (2.42.2-7) ...
Setting up libncurses6:armhf (6.3+20220423-2) ...
Setting up libfribidi0:armhf (1.0.8-2.1) ...
Setting up libboost-regex1.74.0:armhf (1.74.0-17) ...
Setting up libssl-dev:armhf (3.0.5-2) ...
Setting up libpng16-16:armhf (1.6.38-2) ...
Setting up libboost-graph1.74.0:armhf (1.74.0-17) ...
Setting up autopoint (0.21-9) ...
Setting up libjsoncpp25:armhf (1.9.5-4) ...
Setting up icu-devtools (71.1-3) ...
Setting up libgeos-c1v5:armhf (3.11.0-2) ...
Setting up libmariadb3:armhf (1:10.6.10-1) ...
Setting up fonts-dejavu-core (2.37-2) ...
Setting up unixodbc-common (2.3.11-2) ...
Setting up ucf (3.0043) ...
Setting up libgc1:armhf (1:8.2.2-3) ...
Setting up libdav1d6:armhf (1.0.0-2+rpi1) ...
Setting up libltdl7:armhf (2.4.7-4) ...
Setting up libgfortran5:armhf (12.2.0-3+rpi1) ...
Setting up autoconf (2.71-2) ...
Setting up libhdf4-0-alt (4.2.15-4) ...
Setting up libx265-199:armhf (3.5-2) ...
Setting up libwebp7:armhf (1.2.2-2) ...
Setting up libboost-serialization1.74.0:armhf (1.74.0-17) ...
Setting up libgif7:armhf (5.2.1-2.5) ...
Setting up libodbc2:armhf (2.3.11-2) ...
Setting up liburiparser1:armhf (0.9.6+dfsg-1) ...
Setting up libgcc-11-dev:armhf (11.3.0-8+rpi1) ...
Setting up librttopo1:armhf (1.1.0-2) ...
Setting up libmd0:armhf (1.0.4-2) ...
Setting up mount (2.38.1-1.1) ...
Setting up libfreexl1:armhf (1.0.6-1) ...
Setting up librhash0:armhf (1.4.3-3) ...
Setting up xml-core (0.18+nmu1) ...
Setting up libfyba0:armhf (4.1.1-7) ...
Setting up libuchardet0:armhf (0.0.7-1) ...
Setting up libjson-perl (4.10000-1) ...
Setting up libkmlbase1:armhf (1.3.0-9) ...
Setting up libblosc1:armhf (1.21.1+ds2-3) ...
Setting up libmpdec3:armhf (2.5.1-2+rpi1) ...
Setting up libopenjp2-7:armhf (2.5.0-1) ...
Setting up libsub-override-perl (0.09-3) ...
Setting up libthai-data (0.1.29-1) ...
Setting up libssh2-1:armhf (1.10.0-3+b1) ...
Setting up netbase (6.3) ...
Setting up cmake-data (3.24.2-1) ...
Setting up libcdt5:armhf (2.42.2-7) ...
Setting up libcgraph6:armhf (2.42.2-7) ...
Setting up libtiff5:armhf (4.4.0-4) ...
Setting up libjs-jquery (3.6.1+dfsg+~3.5.14-1) ...
Setting up libde265-0:armhf (1.0.8-1+rpi1+b1) ...
Setting up libboost-test1.74-dev:armhf (1.74.0-17) ...
Setting up openssl (3.0.5-2) ...
Setting up libbsd0:armhf (0.11.7-1) ...
Setting up libelf1:armhf (0.187-2+rpi2) ...
Setting up libjson-c5:armhf (0.16-2) ...
Setting up libicu-dev:armhf (71.1-3) ...
Setting up libxml2:armhf (2.9.14+dfsg-1) ...
Setting up libprocps8:armhf (2:3.3.17-7) ...
Setting up libsz2:armhf (1.0.6-1) ...
Setting up libjs-underscore (1.13.4~dfsg+~1.11.4-1) ...
Setting up gdal-plugins (3.5.2+dfsg-1) ...
Setting up libkmldom1:armhf (1.3.0-9) ...
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 (243) ...
Setting up libfile-stripnondeterminism-perl (1.13.0-1) ...
Setting up libz3-dev:armhf (4.8.12-1) ...
Setting up libice6:armhf (2:1.0.10-1) ...
Setting up libodbcinst2:armhf (2.3.11-2) ...
Setting up libxdmcp6:armhf (1:1.1.2-3) ...
Setting up liblapack3:armhf (3.10.1-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.3+20220423-2) ...
Setting up libxcb1:armhf (1.15-1) ...
Setting up gettext (0.21-9) ...
Setting up libkmlengine1:armhf (1.3.0-9) ...
Setting up libtool (2.4.7-4) ...
Setting up libarchive13:armhf (3.6.0-1) ...
Setting up libxcb-render0:armhf (1.15-1) ...
Setting up fontconfig-config (2.13.1-4.5) ...
Setting up libedit2:armhf (3.1-20210910-1) ...
Setting up libheif1:armhf (1.13.0-1) ...
Setting up libarpack2:armhf (3.8.0-1) ...
Setting up libsuperlu5:armhf (5.3.0+dfsg1-2) ...
Setting up libpq-dev (15~rc2-1) ...
Setting up libobjc4:armhf (12.2.0-3+rpi1) ...
Setting up libcurl3-gnutls:armhf (7.85.0-1) ...
Setting up libnss3:armhf (2:3.83-1) ...
Setting up libxcb-shm0:armhf (1.15-1) ...
Setting up postgresql-client-14 (14.5-2) ...
update-alternatives: using /usr/share/postgresql/14/man/man1/psql.1.gz to provide /usr/share/man/man1/psql.1.gz (psql.1.gz) in auto mode
Setting up intltool-debian (0.35.0+20060710.5) ...
Setting up libcfitsio9:armhf (4.1.0-1) ...
Setting up libpython3.10-stdlib:armhf (3.10.7-1) ...
Setting up dh-autoreconf (20) ...
Setting up libthai0:armhf (0.1.29-1) ...
Setting up ca-certificates (20211016) ...
Updating certificates in /etc/ssl/certs...
127 added, 0 removed; done.
Setting up libxml2-dev:armhf (2.9.14+dfsg-1) ...
Setting up libfreetype6:armhf (2.12.1+dfsg-3) ...
Setting up ssl-cert (1.1.2) ...
Setting up postgresql-common (243) ...
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:
Setting up libjs-sphinxdoc (4.5.0-4) ...
Setting up libboost-serialization1.74-dev:armhf (1.74.0-17) ...
Setting up libstdc++-11-dev:armhf (11.3.0-8+rpi1) ...
Setting up dh-strip-nondeterminism (1.13.0-1) ...
Setting up libllvm14:armhf (1:14.0.6-2+rpi1) ...
Setting up libgvpr2:armhf (2.42.2-7) ...
Setting up dwz (0.14+20220924-2) ...
Setting up libboost-regex1.74-dev:armhf (1.74.0-17) ...
Setting up libcurl3-nss:armhf (7.85.0-1) ...
Setting up groff-base (1.22.4-8) ...
Setting up procps (2:3.3.17-7) ...
Setting up libcurl4:armhf (7.85.0-1) ...
Setting up libx11-6:armhf (2:1.8.1-2) ...
Setting up libharfbuzz0b:armhf (5.2.0-2) ...
Setting up llvm-14-linker-tools (1:14.0.6-2+rpi1) ...
Setting up libsm6:armhf (2:1.2.3-1) ...
Setting up libpython3-stdlib:armhf (3.10.6-1) ...
Setting up libtinfo-dev:armhf (6.3+20220423-2) ...
Setting up libxerces-c3.2:armhf (3.2.3+debian-3+b1) ...
Setting up python3.10 (3.10.7-1) ...
Setting up libxpm4:armhf (1:3.5.12-1) ...
Setting up libarmadillo11 (1:11.2.3+dfsg-1) ...
Setting up libxrender1:armhf (1:0.9.10-1.1) ...
Setting up libproj25:armhf (9.1.0-1) ...
Setting up po-debconf (1.0.21+nmu1) ...
Setting up libxext6:armhf (2:1.3.4-1) ...
Setting up libobjc-11-dev:armhf (11.3.0-8+rpi1) ...
Setting up libclang1-14 (1:14.0.6-2+rpi1) ...
Setting up python3 (3.10.6-1) ...
Setting up man-db (2.10.2-3) ...
Not building database; man-db/auto-update is not 'true'.
Setting up python3-markupsafe (2.1.1-1) ...
Setting up python3-tz (2022.4-1) ...
Setting up libgeotiff5:armhf (1.7.1-1+b1) ...
Setting up python3-six (1.16.0-4) ...
Setting up python3-roman (3.3-1) ...
Setting up python3-jinja2 (3.0.3-2) ...
Setting up python3-pyparsing (3.0.7-2) ...
Setting up llvm-14-runtime (1:14.0.6-2+rpi1) ...
Setting up python3-certifi (2022.6.15-2) ...
Setting up python3-snowballstemmer (2.2.0-1) ...
Setting up libboost-graph1.74-dev:armhf (1.74.0-17) ...
Setting up sphinx-common (4.5.0-4) ...
Setting up libclang-common-14-dev (1:14.0.6-2+rpi1) ...
Setting up python3-idna (3.3-1) ...
Setting up libclang-cpp14 (1:14.0.6-2+rpi1) ...
Setting up libxt6:armhf (1:1.2.1-1) ...
Setting up python3-urllib3 (1.26.12-1) ...
Setting up libhdf5-103-1:armhf (1.10.8+repack-1) ...
Setting up cmake (3.24.2-1) ...
Setting up python3-lib2to3 (3.10.7-1) ...
Setting up python3-imagesize (1.4.1-1) ...
Setting up libhdf5-hl-100:armhf (1.10.8+repack-1) ...
Setting up llvm-14 (1:14.0.6-2+rpi1) ...
Setting up python3-pkg-resources (59.6.0-1.2) ...
Setting up python3-distutils (3.10.7-1) ...
Setting up libspatialite7:armhf (5.0.1-2+b2) ...
Setting up python3-more-itertools (8.10.0-2) ...
Setting up libboost-graph-dev:armhf (1.74.0.3+b4) ...
Setting up libxmu6:armhf (2:1.1.3-3) ...
Setting up clang-14 (1:14.0.6-2+rpi1) ...
Setting up python3-babel (2.10.3-1) ...
update-alternatives: using /usr/bin/pybabel-python3 to provide /usr/bin/pybabel (pybabel) in auto mode
Setting up python3-charset-normalizer (2.0.6-2) ...
Setting up python3-alabaster (0.7.12-1) ...
Setting up python3-yaml (5.4.1-1+b1) ...
Setting up debhelper (13.10) ...
Setting up libxaw7:armhf (2:1.0.14-1) ...
Setting up python3-zipp (1.0.0-4) ...
Setting up python3-pygments (2.12.0+dfsg-2) ...
Setting up python3-packaging (21.3-1.1) ...
Setting up python3-chardet (4.0.0-2) ...
Setting up python3-requests (2.27.1+dfsg-1) ...
Setting up libnetcdf19:armhf (1:4.9.0-3+b2) ...
Setting up llvm-14-tools (1:14.0.6-2+rpi1) ...
Setting up python3-importlib-metadata (4.12.0-1) ...
Setting up llvm-14-dev (1:14.0.6-2+rpi1) ...
Setting up postgresql-server-dev-14 (14.5-2) ...
Setting up postgresql-server-dev-all:armhf (243) ...
Processing triggers for libc-bin (2.35-1+rpi2) ...
Processing triggers for sgml-base (1.30) ...
Setting up libfontconfig1:armhf (2.13.1-4.5) ...
Setting up libpoppler123:armhf (22.08.0-2.1) ...
Setting up fontconfig (2.13.1-4.5) ...
Regenerating fonts cache... done.
Setting up libpango-1.0-0:armhf (1.50.10+ds-1) ...
Setting up libcairo2:armhf (1.16.0-6) ...
Setting up libgdal31 (3.5.2+dfsg-1) ...
Setting up libgd3:armhf (2.3.3-6+b3) ...
Setting up docutils-common (0.17.1+dfsg-2) ...
Setting up libpangoft2-1.0-0:armhf (1.50.10+ds-1) ...
Setting up libpangocairo-1.0-0:armhf (1.50.10+ds-1) ...
Setting up postgis (3.3.1+dfsg-1) ...
Setting up libgvc6 (2.42.2-7) ...
Setting up graphviz (2.42.2-7) ...
Processing triggers for sgml-base (1.30) ...
Setting up python3-docutils (0.17.1+dfsg-2) ...
Setting up python3-sphinx (4.5.0-4) ...
Setting up sbuild-build-depends-main-dummy (0.invalid.0) ...
Processing triggers for ca-certificates (20211016) ...
Updating certificates in /etc/ssl/certs...
0 added, 0 removed; done.
Running hooks in /etc/ca-certificates/update.d...
done.
Processing triggers for libc-bin (2.35-1+rpi2) ...

+------------------------------------------------------------------------------+
| Check architectures                                                          |
+------------------------------------------------------------------------------+

Arch check ok (armhf included in any all)

+------------------------------------------------------------------------------+
| Build environment                                                            |
+------------------------------------------------------------------------------+

Kernel: Linux 4.19.20-v7+ #1 SMP Mon Mar 18 11:37:02 GMT 2019 armhf (armv7l)
Toolchain package versions: binutils_2.39-6+rpi1 dpkg-dev_1.21.9+rpi1 g++-12_12.2.0-3+rpi1 gcc-12_12.2.0-3+rpi1 libc6-dev_2.35-1+rpi2 libstdc++-11-dev_11.3.0-8+rpi1 libstdc++-12-dev_12.2.0-3+rpi1 libstdc++6_12.2.0-3+rpi1 linux-libc-dev_5.19.6-1+rpi1
Package versions: adduser_3.129 apt_2.5.3 autoconf_2.71-2 automake_1:1.16.5-1.3 autopoint_0.21-9 autotools-dev_20220109.1 base-files_12.2+rpi1 base-passwd_3.6.1 bash_5.2~rc2-2 binutils_2.39-6+rpi1 binutils-arm-linux-gnueabihf_2.39-6+rpi1 binutils-common_2.39-6+rpi1 bsdextrautils_2.38.1-1.1 bsdutils_1:2.38.1-1.1 build-essential_12.9 bzip2_1.0.8-5+b2 ca-certificates_20211016 clang-14_1:14.0.6-2+rpi1 cmake_3.24.2-1 cmake-data_3.24.2-1 coreutils_9.1-1 cpp_4:12.2.0-1+rpi1 cpp-12_12.2.0-3+rpi1 dash_0.5.11+git20210903+057cd650a4ed-9 debconf_1.5.79 debhelper_13.10 debianutils_5.7-0.3 dh-autoreconf_20 dh-elpa-helper_2.0.14 dh-strip-nondeterminism_1.13.0-1 diffutils_1:3.8-1 dirmngr_2.2.39-1 docutils-common_0.17.1+dfsg-2 dpkg_1.21.9+rpi1 dpkg-dev_1.21.9+rpi1 dwz_0.14+20220924-2 e2fsprogs_1.46.6~rc1-1 emacsen-common_3.0.4 fakeroot_1.29-1 file_1:5.41-4 findutils_4.9.0-3 fontconfig_2.13.1-4.5 fontconfig-config_2.13.1-4.5 fonts-dejavu-core_2.37-2 fonts-mathjax_2.7.9+dfsg-1 g++_4:12.2.0-1+rpi1 g++-12_12.2.0-3+rpi1 gcc_4:12.2.0-1+rpi1 gcc-11-base_11.3.0-8+rpi1 gcc-12_12.2.0-3+rpi1 gcc-12-base_12.2.0-3+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.5.2+dfsg-1 gdal-plugins_3.5.2+dfsg-1 gettext_0.21-9 gettext-base_0.21-9 gnupg_2.2.39-1 gnupg-l10n_2.2.39-1 gnupg-utils_2.2.39-1 gpg_2.2.39-1 gpg-agent_2.2.39-1 gpg-wks-client_2.2.39-1 gpg-wks-server_2.2.39-1 gpgconf_2.2.39-1 gpgsm_2.2.39-1 gpgv_2.2.39-1 graphviz_2.42.2-7 grep_3.7-1 groff-base_1.22.4-8 gzip_1.12-1 hostname_3.23 icu-devtools_71.1-3 init-system-helpers_1.64 intltool-debian_0.35.0+20060710.5 iputils-ping_3:20211215-1 krb5-locales_1.20-1 libacl1_2.3.1-1 libaec0_1.0.6-1 libaom3_3.5.0-1 libapt-pkg6.0_2.5.3 libarchive-zip-perl_1.68-1 libarchive13_3.6.0-1 libarmadillo11_1:11.2.3+dfsg-1 libarpack2_3.8.0-1 libasan6_11.3.0-8+rpi1 libasan8_12.2.0-3+rpi1 libassuan0_2.5.5-4 libatomic1_12.2.0-3+rpi1 libattr1_1:2.5.1-1 libaudit-common_1:3.0.7-1.1 libaudit1_1:3.0.7-1.1 libbinutils_2.39-6+rpi1 libblas3_3.10.1-2 libblkid1_2.38.1-1.1 libblosc1_1.21.1+ds2-3 libboost-graph-dev_1.74.0.3+b4 libboost-graph1.74-dev_1.74.0-17 libboost-graph1.74.0_1.74.0-17 libboost-regex1.74-dev_1.74.0-17 libboost-regex1.74.0_1.74.0-17 libboost-serialization1.74-dev_1.74.0-17 libboost-serialization1.74.0_1.74.0-17 libboost-test1.74-dev_1.74.0-17 libboost-test1.74.0_1.74.0-17 libboost1.74-dev_1.74.0-17 libbrotli1_1.0.9-2+b2 libbsd0_0.11.7-1 libbz2-1.0_1.0.8-5+b2 libc-bin_2.35-1+rpi2 libc-dev-bin_2.35-1+rpi2 libc6_2.35-1+rpi2 libc6-dev_2.35-1+rpi2 libcairo2_1.16.0-6 libcap-ng0_0.8.3-1 libcap2_1:2.44-1 libcap2-bin_1:2.44-1 libcc1-0_12.2.0-3+rpi1 libcdt5_2.42.2-7 libcfitsio9_4.1.0-1 libcgraph6_2.42.2-7 libclang-common-14-dev_1:14.0.6-2+rpi1 libclang-cpp14_1:14.0.6-2+rpi1 libclang1-14_1:14.0.6-2+rpi1 libcom-err2_1.46.6~rc1-1 libcrypt-dev_1:4.4.28-2 libcrypt1_1:4.4.28-2 libctf-nobfd0_2.39-6+rpi1 libctf0_2.39-6+rpi1 libcurl3-gnutls_7.85.0-1 libcurl3-nss_7.85.0-1 libcurl4_7.85.0-1 libdatrie1_0.2.13-2+b2 libdav1d6_1.0.0-2+rpi1 libdb5.3_5.3.28+dfsg1-0.10 libde265-0_1.0.8-1+rpi1+b1 libdebconfclient0_0.264 libdebhelper-perl_13.10 libdeflate0_1.14-1 libdpkg-perl_1.21.9+rpi1 libedit2_3.1-20210910-1 libelf1_0.187-2+rpi2 libexpat1_2.4.9-1 libext2fs2_1.46.6~rc1-1 libfakeroot_1.29-1 libffi-dev_3.4.2-4 libffi8_3.4.2-4 libfile-stripnondeterminism-perl_1.13.0-1 libfontconfig1_2.13.1-4.5 libfreetype6_2.12.1+dfsg-3 libfreexl1_1.0.6-1 libfribidi0_1.0.8-2.1 libfyba0_4.1.1-7 libgc1_1:8.2.2-3 libgcc-11-dev_11.3.0-8+rpi1 libgcc-12-dev_12.2.0-3+rpi1 libgcc-s1_12.2.0-3+rpi1 libgcrypt20_1.10.1-2+b2 libgd3_2.3.3-6+b3 libgdal31_3.5.2+dfsg-1 libgdbm-compat4_1.23-2 libgdbm6_1.23-2 libgeos-c1v5_3.11.0-2 libgeos3.11.0_3.11.0-2 libgeotiff5_1.7.1-1+b1 libgfortran5_12.2.0-3+rpi1 libgif7_5.2.1-2.5 libglib2.0-0_2.74.0-2 libgmp10_2:6.2.1+dfsg1-1 libgnutls30_3.7.7-2 libgomp1_12.2.0-3+rpi1 libgpg-error0_1.45-2 libgraphite2-3_1.3.14-1 libgssapi-krb5-2_1.20-1 libgts-0.7-5_0.7.6+darcs121130-5 libgvc6_2.42.2-7 libgvpr2_2.42.2-7 libharfbuzz0b_5.2.0-2 libhdf4-0-alt_4.2.15-4 libhdf5-103-1_1.10.8+repack-1 libhdf5-hl-100_1.10.8+repack-1 libheif1_1.13.0-1 libhogweed6_3.8.1-2 libice6_2:1.0.10-1 libicu-dev_71.1-3 libicu71_71.1-3 libidn2-0_2.3.3-1 libisl23_0.25-1 libjbig0_2.1-3.1+b2 libjpeg62-turbo_1:2.1.2-1 libjs-jquery_3.6.1+dfsg+~3.5.14-1 libjs-mathjax_2.7.9+dfsg-1 libjs-sphinxdoc_4.5.0-4 libjs-underscore_1.13.4~dfsg+~1.11.4-1 libjson-c5_0.16-2 libjson-perl_4.10000-1 libjsoncpp25_1.9.5-4 libk5crypto3_1.20-1 libkeyutils1_1.6.3-1 libkmlbase1_1.3.0-9 libkmldom1_1.3.0-9 libkmlengine1_1.3.0-9 libkrb5-3_1.20-1 libkrb5support0_1.20-1 libksba8_1.6.0-3 liblab-gamut1_2.42.2-7 liblapack3_3.10.1-2 liblcms2-2_2.13.1-1 libldap-2.5-0_2.5.13+dfsg-2+rpi1 liblerc4_4.0.0+ds-1 libllvm14_1:14.0.6-2+rpi1 libltdl7_2.4.7-4 liblz4-1_1.9.4-1+rpi1 liblzma5_5.2.5-2.1 libmagic-mgc_1:5.41-4 libmagic1_1:5.41-4 libmariadb3_1:10.6.10-1 libmd0_1.0.4-2 libminizip1_1.1-8+b1 libmount1_2.38.1-1.1 libmpc3_1.2.1-2 libmpdec3_2.5.1-2+rpi1 libmpfr6_4.1.0-3 libncurses-dev_6.3+20220423-2 libncurses6_6.3+20220423-2 libncursesw6_6.3+20220423-2 libnetcdf19_1:4.9.0-3+b2 libnettle8_3.8.1-2 libnghttp2-14_1.50.0-1 libnpth0_1.6-3 libnsl-dev_1.3.0-2 libnsl2_1.3.0-2 libnspr4_2:4.35-1 libnss3_2:3.83-1 libobjc-11-dev_11.3.0-8+rpi1 libobjc4_12.2.0-3+rpi1 libodbc2_2.3.11-2 libodbcinst2_2.3.11-2 libogdi4.1_4.1.0+ds-5+b1 libopenjp2-7_2.5.0-1 libp11-kit0_0.24.1-1 libpam-cap_1:2.44-1 libpam-modules_1.5.2-2 libpam-modules-bin_1.5.2-2 libpam-runtime_1.5.2-2 libpam0g_1.5.2-2 libpango-1.0-0_1.50.10+ds-1 libpangocairo-1.0-0_1.50.10+ds-1 libpangoft2-1.0-0_1.50.10+ds-1 libpathplan4_2.42.2-7 libpcre2-8-0_10.40-1+b2 libpcre3_2:8.39-14 libperl5.32_5.32.1-6 libperl5.34_5.34.0-5 libpfm4_4.12.0-1 libpipeline1_1.5.6-3 libpixman-1-0_0.40.0-1 libpng16-16_1.6.38-2 libpoppler123_22.08.0-2.1 libpq-dev_15~rc2-1 libpq5_15~rc2-1 libprocps8_2:3.3.17-7 libproj25_9.1.0-1 libpsl5_0.21.0-1.2 libpython3-stdlib_3.10.6-1 libpython3.10-minimal_3.10.7-1 libpython3.10-stdlib_3.10.7-1 libqhull-r8.0_2020.2-5 libreadline8_8.2-1 librhash0_1.4.3-3 librtmp1_2.4+20151223.gitfa8646d.1-2+b2 librttopo1_1.1.0-2 libsasl2-2_2.1.28+dfsg-8 libsasl2-modules-db_2.1.28+dfsg-8 libseccomp2_2.5.4-1+rpi1 libselinux1_3.4-1 libsemanage-common_3.4-1 libsemanage2_3.4-1 libsepol1_3.1-1 libsepol2_3.4-2 libsm6_2:1.2.3-1 libsmartcols1_2.38.1-1.1 libsnappy1v5_1.1.9-2 libspatialite7_5.0.1-2+b2 libsqlite3-0_3.39.4-1 libss2_1.46.6~rc1-1 libssh2-1_1.10.0-3+b1 libssl-dev_3.0.5-2 libssl1.1_1.1.1o-1 libssl3_3.0.5-2 libstdc++-11-dev_11.3.0-8+rpi1 libstdc++-12-dev_12.2.0-3+rpi1 libstdc++6_12.2.0-3+rpi1 libsub-override-perl_0.09-3 libsuperlu5_5.3.0+dfsg1-2 libsystemd0_251.4-3+rpi1 libsz2_1.0.6-1 libtasn1-6_4.19.0-2 libthai-data_0.1.29-1 libthai0_0.1.29-1 libtiff5_4.4.0-4 libtinfo-dev_6.3+20220423-2 libtinfo6_6.3+20220423-2 libtirpc-common_1.3.3+ds-1 libtirpc-dev_1.3.3+ds-1 libtirpc3_1.3.3+ds-1 libtool_2.4.7-4 libubsan1_12.2.0-3+rpi1 libuchardet0_0.0.7-1 libudev1_251.4-3+rpi1 libunistring2_1.0-1 liburiparser1_0.9.6+dfsg-1 libuuid1_2.38.1-1.1 libuv1_1.44.2-1+rpi1 libwebp7_1.2.2-2 libx11-6_2:1.8.1-2 libx11-data_2:1.8.1-2 libx265-199_3.5-2 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.3+debian-3+b1 libxext6_2:1.3.4-1 libxml2_2.9.14+dfsg-1 libxml2-dev_2.9.14+dfsg-1 libxmu6_2:1.1.3-3 libxpm4_1:3.5.12-1 libxrender1_1:0.9.10-1.1 libxt6_1:1.2.1-1 libxxhash0_0.8.1-1 libyaml-0-2_0.2.5-1 libz3-4_4.8.12-1 libz3-dev_4.8.12-1 libzstd1_1.5.2+dfsg-1 linux-libc-dev_5.19.6-1+rpi1 llvm-14_1:14.0.6-2+rpi1 llvm-14-dev_1:14.0.6-2+rpi1 llvm-14-linker-tools_1:14.0.6-2+rpi1 llvm-14-runtime_1:14.0.6-2+rpi1 llvm-14-tools_1:14.0.6-2+rpi1 login_1:4.11.1+dfsg1-2 logsave_1.46.6~rc1-1 lsb-base_11.4+rpi1 m4_1.4.19-1 make_4.3-4.1 man-db_2.10.2-3 mariadb-common_1:10.6.10-1 mawk_1.3.4.20200120-3.1 media-types_8.0.0 mount_2.38.1-1.1 mysql-common_5.8+1.0.8 nano_6.4-1 ncurses-base_6.3+20220423-2 ncurses-bin_6.3+20220423-2 netbase_6.3 openssl_3.0.5-2 passwd_1:4.11.1+dfsg1-2 patch_2.7.6-7 perl_5.34.0-5 perl-base_5.34.0-5 perl-modules-5.32_5.32.1-6 perl-modules-5.34_5.34.0-5 pinentry-curses_1.2.0-2 po-debconf_1.0.21+nmu1 postgis_3.3.1+dfsg-1 postgresql-client-14_14.5-2 postgresql-client-common_243 postgresql-common_243 postgresql-server-dev-14_14.5-2 postgresql-server-dev-all_243 procps_2:3.3.17-7 proj-data_9.1.0-1 python-babel-localedata_2.10.3-1 python3_3.10.6-1 python3-alabaster_0.7.12-1 python3-babel_2.10.3-1 python3-certifi_2022.6.15-2 python3-chardet_4.0.0-2 python3-charset-normalizer_2.0.6-2 python3-distutils_3.10.7-1 python3-docutils_0.17.1+dfsg-2 python3-idna_3.3-1 python3-imagesize_1.4.1-1 python3-importlib-metadata_4.12.0-1 python3-jinja2_3.0.3-2 python3-lib2to3_3.10.7-1 python3-markupsafe_2.1.1-1 python3-minimal_3.10.6-1 python3-more-itertools_8.10.0-2 python3-packaging_21.3-1.1 python3-pkg-resources_59.6.0-1.2 python3-pygments_2.12.0+dfsg-2 python3-pyparsing_3.0.7-2 python3-requests_2.27.1+dfsg-1 python3-roman_3.3-1 python3-six_1.16.0-4 python3-snowballstemmer_2.2.0-1 python3-sphinx_4.5.0-4 python3-tz_2022.4-1 python3-urllib3_1.26.12-1 python3-yaml_5.4.1-1+b1 python3-zipp_1.0.0-4 python3.10_3.10.7-1 python3.10-minimal_3.10.7-1 raspbian-archive-keyring_20120528.2 rdfind_1.5.0-1.1 readline-common_8.2-1 rpcsvc-proto_1.4.2-4 sbuild-build-depends-main-dummy_0.invalid.0 sed_4.8-1 sensible-utils_0.0.17 sgml-base_1.30 sphinx-common_4.5.0-4 ssl-cert_1.1.2 sysvinit-utils_3.05-6 tar_1.34+dfsg-1 tzdata_2022d-1 ucf_3.0043 unixodbc-common_2.3.11-2 util-linux_2.38.1-1.1 util-linux-extra_2.38.1-1.1 x11-common_1:7.7+23 xml-core_0.18+nmu1 xz-utils_5.2.5-2.1 zlib1g_1:1.2.11.dfsg-4.1

+------------------------------------------------------------------------------+
| Build                                                                        |
+------------------------------------------------------------------------------+


Unpack source
-------------

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA512

Format: 3.0 (quilt)
Source: pgrouting
Binary: postgresql-14-pgrouting, postgresql-14-pgrouting-scripts, postgresql-14-pgrouting-doc
Architecture: any all
Version: 3.4.1-1
Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
Uploaders: Michael Fladischer <FladischerMichael@fladi.at>
Homepage: https://www.pgrouting.org
Standards-Version: 4.6.1
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 (= 12), graphviz, libboost-graph-dev, libjs-mathjax, postgis, postgresql-server-dev-all, python3-sphinx (>= 1.8), rdfind
Package-List:
 postgresql-14-pgrouting deb misc optional arch=any
 postgresql-14-pgrouting-doc deb doc optional arch=all
 postgresql-14-pgrouting-scripts deb misc optional arch=all
Checksums-Sha1:
 814829f892df661866e6b69d65c22cb2520b9e52 3735278 pgrouting_3.4.1.orig.tar.gz
 33bd42f37e9a604d5476b6632c9574762fd73805 15760 pgrouting_3.4.1-1.debian.tar.xz
Checksums-Sha256:
 a4e034efee8cf67582b67033d9c3ff714a09d8f5425339624879df50aff3f642 3735278 pgrouting_3.4.1.orig.tar.gz
 0016b33ae611a6c95ee6d4f3ee0cba44ba36799af26dbdd9cb3c4fbcc6971316 15760 pgrouting_3.4.1-1.debian.tar.xz
Files:
 058afd5772697fbf95c24ef9e3bd4975 3735278 pgrouting_3.4.1.orig.tar.gz
 c8d9264159a67127a859e12e800dc500 15760 pgrouting_3.4.1-1.debian.tar.xz

-----BEGIN PGP SIGNATURE-----

iQIzBAEBCgAdFiEEgYLeQXBWQI1hRlDRZ1DxCuiNSvEFAmNGRvoACgkQZ1DxCuiN
SvHgnxAAyB+TAXt0S5nSy7KFj51KxFBj1xpsXQAgN4yi1qn2m9CCqHj2Xj2MhHDg
yx5XI5S4eRduTQXNI/LYTuOv99Zzrvexc2S4PO2g+9Pa5V+zKysrDD2TVz9LAOmD
n2keOUwG5dFvougCDMvdR/GOuT2+mdXkCdHXarayWytn7+XxzaZ0DeJcmVl0/ilD
Xc19LSLi5g7HlVY2kuMXvWCGCaQwyiHuMBO+X/ewf96LOHTmgj/jqxx7st0a9m1p
bvjWBbUjHVi03SeVg/Q/twGW9q9ar/O2zKx/+CA2Ur7TTZ1m340Xu40vtCGYp9KT
O5CwTqarjIYbYtAeKW1c6Y6I5wd2QrknnDW8oJoV9eybbHiNoYJibr6ZD5z74hxT
baHx+uqUiRdXPidDAWjsJ6+B0mWApEglnmQh1+rdRXGwyNKrvFIcVz26T+9CI0xt
VZq+U+hcZ52rcsKchxC3RTgk0ga1JtOQhb1Bvot/Fy3dE7L6lRthLzTG8Ovq64lT
VDFuskPXfPdJj26+qm55PjftA72c+Qpx2x9CZl4/QHSYUyn2lUUV4ENJ8y0L951p
n/EnGm8bdw847ph59PjvbDAUikD4bnglG2usMsLnElfdHzJMqD0BuWVyBNLwvnSh
QRZ5KeiN6ubR/iAHvg/SsjTJ7c1syti1BPJdHOXvsRhbjjDDR1s=
=YVhM
-----END PGP SIGNATURE-----

gpgv: unknown type of key resource 'trustedkeys.kbx'
gpgv: keyblock resource '/tmp/dpkg-verify-sig.F03OSOWB/trustedkeys.kbx': General error
gpgv: Signature made Wed Oct 12 04:47:54 2022 UTC
gpgv:                using RSA key 8182DE417056408D614650D16750F10AE88D4AF1
gpgv: Can't check signature: No public key
dpkg-source: warning: cannot verify signature ./pgrouting_3.4.1-1.dsc
dpkg-source: info: extracting pgrouting in /<<PKGBUILDDIR>>
dpkg-source: info: unpacking pgrouting_3.4.1.orig.tar.gz
dpkg-source: info: unpacking pgrouting_3.4.1-1.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

Check disk space
----------------

Sufficient free space for build

User Environment
----------------

APT_CONFIG=/var/lib/sbuild/apt.conf
DBUS_SESSION_BUS_ADDRESS=unix:path=/run/user/112/bus
DEB_BUILD_OPTIONS=parallel=4
HOME=/sbuild-nonexistent
INVOCATION_ID=79d111ecf76d4d72929efb4c6c309344
JOURNAL_STREAM=8:26624
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
PWD=/
SCHROOT_ALIAS_NAME=bookworm-staging-armhf-sbuild
SCHROOT_CHROOT_NAME=bookworm-staging-armhf-sbuild
SCHROOT_COMMAND=env
SCHROOT_GID=117
SCHROOT_GROUP=buildd
SCHROOT_SESSION_ID=bookworm-staging-armhf-sbuild-5036b104-2032-4a8f-9614-15c287b5a9f6
SCHROOT_UID=112
SCHROOT_USER=buildd
SHELL=/bin/sh
USER=buildd
XDG_RUNTIME_DIR=/run/user/112
XDG_SESSION_CLASS=background
XDG_SESSION_ID=c108620
XDG_SESSION_TYPE=unspecified

dpkg-buildpackage
-----------------

Command: dpkg-buildpackage -us -uc -mRaspbian pi4 based autobuilder <root@raspbian.org> -B -rfakeroot
dpkg-buildpackage: info: source package pgrouting
dpkg-buildpackage: info: source version 3.4.1-1
dpkg-buildpackage: info: source distribution unstable
 dpkg-source --before-build .
dpkg-buildpackage: info: host architecture armhf
 fakeroot 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 --with sphinxdoc
   debian/rules override_dh_auto_clean
make[1]: Entering directory '/<<PKGBUILDDIR>>'
pg_buildext clean build-%v
rm -rf build-*/
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
   debian/rules override_dh_clean
make[1]: Entering directory '/<<PKGBUILDDIR>>'
dh_clean debian/postgresql-*-pgrouting.install \
         debian/postgresql-*-pgrouting-scripts.install
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
 debian/rules build-arch
dh build-arch --with sphinxdoc
   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
-- Setting build type to 'Release' as none was specified.
-- CMAKE_BUILD_TYPE Release
-- The C compiler identification is GNU 12.2.0
-- The CXX compiler identification is GNU 12.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.34.0") 
-- POSTGRESQL_PG_CONFIG is /usr/lib/postgresql/14/bin/pg_config
-- POSTGRESQL_EXECUTABLE is POSTGRESQL_EXECUTABLE-NOTFOUND
-- POSTGRESQL_VERSION_STRING in FindPostgreSQL.cmake is PostgreSQL 14.5 (Raspbian 14.5-2)
-- POSTGRESQL_INCLUDE_DIR: /usr/include/postgresql/14/server
-- POSTGRESQL_LIBRARIES: /usr/lib/arm-linux-gnueabihf
-- POSTGRESQL_VERSION_STRING=PostgreSQL 14.5 (Raspbian 14.5-2)
-- POSTGRESQL_VERSION=14.5
-- PGSQL_VERSION=145
-- LIBRARY_INSTALL_PATH /usr/lib/postgresql/14/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'
-- Found PythonInterp: /usr/bin/python3.10 (found version "3.10.7") 
-- SPHINX_VERSION sphinx-build 4.5.0
-- SPHINX_VERSION 4.5.0
-- Found Sphinx: /usr/bin/sphinx-build (Required is at least version "1.8") 
-- PGR_DOCUMENTATION_BUILD_DIR = /<<PKGBUILDDIR>>/build-14/doc
-- Configuring done
-- Generating done
-- Build files have been written to: /<<PKGBUILDDIR>>/build-14
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 14 build ###
make[2]: Entering directory '/<<PKGBUILDDIR>>/build-14'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-14 --check-build-system CMakeFiles/Makefile.cmake 0
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-14/CMakeFiles /<<PKGBUILDDIR>>/build-14//CMakeFiles/progress.marks
make  -f CMakeFiles/Makefile2 all
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/circuits /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/circuits /<<PKGBUILDDIR>>/build-14/src/circuits/CMakeFiles/circuits.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[  0%] Building C object src/circuits/CMakeFiles/circuits.dir/hawickCircuits.c.o
cd /<<PKGBUILDDIR>>/build-14/src/circuits && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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-14/src/circuits && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[  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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dijkstra /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/dijkstra /<<PKGBUILDDIR>>/build-14/src/dijkstra/CMakeFiles/dijkstra.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/dijkstra/CMakeFiles/dijkstra.dir/build.make src/dijkstra/CMakeFiles/dijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[  1%] Building C object src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra.c.o
cd /<<PKGBUILDDIR>>/build-14/src/dijkstra && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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-14/src/dijkstra && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[  2%] Building CXX object src/dijkstra/CMakeFiles/dijkstra.dir/dijkstra_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/dijkstra && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:40:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:902: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
  902 |     __unique(_ForwardIterator __first, _ForwardIterator __last,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:902: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:43:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:39:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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::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:520: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:949: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:408: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:361:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::vector<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:251:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:108:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:108:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:110:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:113:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:113:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:115:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::vector<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:251:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:108:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:108:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:110:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:113:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:113:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> detail::pgr_dijkstra(G&, std::vector<long long int>, std::vector<long long int>, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:115:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:333:37,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<II_t_rt>&, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:140:10,
    inlined from ‘void do_pgr_combinations_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:303:41:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:336:44,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<II_t_rt>&, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:140:10,
    inlined from ‘void do_pgr_combinations_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:303:41:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:333:37,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<II_t_rt>&, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:140:10,
    inlined from ‘void do_pgr_combinations_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:310:41:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:336:44,
    inlined from ‘std::deque<Path> detail::pgr_dijkstra(G&, std::vector<II_t_rt>&, bool, bool, 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>>/src/dijkstra/dijkstra_driver.cpp:140:10,
    inlined from ‘void do_pgr_combinations_dijkstra(Edge_t*, size_t, II_t_rt*, size_t, bool, bool, bool, int64_t, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstra_driver.cpp:310:41:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[  3%] Building CXX object src/dijkstra/CMakeFiles/dijkstra.dir/dijkstraVia_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/dijkstra && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:36,
                 from /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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 ‘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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 = 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:520: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:949: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:408: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:361:26,
    inlined from ‘void do_pgr_dijkstraVia(Edge_t*, size_t, int64_t*, size_t, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp:123:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361:26,
    inlined from ‘void do_pgr_dijkstraVia(Edge_t*, size_t, int64_t*, size_t, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp:123:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361:26,
    inlined from ‘void do_pgr_dijkstraVia(Edge_t*, size_t, int64_t*, size_t, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp:134:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361:26,
    inlined from ‘void do_pgr_dijkstraVia(Edge_t*, size_t, int64_t*, size_t, bool, bool, bool, Routes_t**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/dijkstra/dijkstraVia_driver.cpp:134:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[  3%] Built target dijkstra
make  -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/allpairs /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/allpairs /<<PKGBUILDDIR>>/build-14/src/allpairs/CMakeFiles/allpairs.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[  3%] Building C object src/allpairs/CMakeFiles/allpairs.dir/floydWarshall.c.o
cd /<<PKGBUILDDIR>>/build-14/src/allpairs && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[  3%] Building CXX object src/allpairs/CMakeFiles/allpairs.dir/floydWarshall_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/allpairs && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:33,
                 from /<<PKGBUILDDIR>>/src/allpairs/floydWarshall_driver.cpp:36:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:520: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:949: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:408: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:361: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:66:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:66:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:71:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:71:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[  4%] Building C object src/allpairs/CMakeFiles/allpairs.dir/johnson.c.o
cd /<<PKGBUILDDIR>>/build-14/src/allpairs && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[  4%] Building CXX object src/allpairs/CMakeFiles/allpairs.dir/johnson_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/allpairs && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:33,
                 from /<<PKGBUILDDIR>>/src/allpairs/johnson_driver.cpp:36:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/allpairs/pgr_allpairs.hpp:35:
/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 = 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 = 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++/12/map:61,
                 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:520: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:949: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:408: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:361: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:64:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:64:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:69:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:69:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[  4%] Built target allpairs
make  -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/common /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/common /<<PKGBUILDDIR>>/build-14/src/common/CMakeFiles/common.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[  5%] Building C object src/common/CMakeFiles/common.dir/postgres_connection.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[  5%] Building C object src/common/CMakeFiles/common.dir/e_report.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[  6%] Building CXX object src/common/CMakeFiles/common.dir/basePath_SSEC.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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 ‘Path Path::getSubpath(unsigned int) const’:
/<<PKGBUILDDIR>>/src/common/basePath_SSEC.cpp:153: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]
  153 |     for (auto i = path.begin(); i != path.begin() + j; ++i) {
      |                                                     ^
[  6%] Building C object src/common/CMakeFiles/common.dir/points_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/points_input.c.o -MF CMakeFiles/common.dir/points_input.c.o.d -o CMakeFiles/common.dir/points_input.c.o -c /<<PKGBUILDDIR>>/src/common/points_input.c
[  7%] Building C object src/common/CMakeFiles/common.dir/matrixRows_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/matrixRows_input.c.o -MF CMakeFiles/common.dir/matrixRows_input.c.o.d -o CMakeFiles/common.dir/matrixRows_input.c.o -c /<<PKGBUILDDIR>>/src/common/matrixRows_input.c
[  7%] Building C object src/common/CMakeFiles/common.dir/get_check_data.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/get_check_data.c.o -MF CMakeFiles/common.dir/get_check_data.c.o.d -o CMakeFiles/common.dir/get_check_data.c.o -c /<<PKGBUILDDIR>>/src/common/get_check_data.c
[  8%] Building C object src/common/CMakeFiles/common.dir/edges_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/edges_input.c.o -MF CMakeFiles/common.dir/edges_input.c.o.d -o CMakeFiles/common.dir/edges_input.c.o -c /<<PKGBUILDDIR>>/src/common/edges_input.c
[  8%] Building C object src/common/CMakeFiles/common.dir/combinations_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/combinations_input.c.o -MF CMakeFiles/common.dir/combinations_input.c.o.d -o CMakeFiles/common.dir/combinations_input.c.o -c /<<PKGBUILDDIR>>/src/common/combinations_input.c
[  9%] Building C object src/common/CMakeFiles/common.dir/orders_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/orders_input.c.o -MF CMakeFiles/common.dir/orders_input.c.o.d -o CMakeFiles/common.dir/orders_input.c.o -c /<<PKGBUILDDIR>>/src/common/orders_input.c
[  9%] Building C object src/common/CMakeFiles/common.dir/vehicles_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/vehicles_input.c.o -MF CMakeFiles/common.dir/vehicles_input.c.o.d -o CMakeFiles/common.dir/vehicles_input.c.o -c /<<PKGBUILDDIR>>/src/common/vehicles_input.c
[ 10%] Building C object src/common/CMakeFiles/common.dir/restrictions_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/restrictions_input.c.o -MF CMakeFiles/common.dir/restrictions_input.c.o.d -o CMakeFiles/common.dir/restrictions_input.c.o -c /<<PKGBUILDDIR>>/src/common/restrictions_input.c
/<<PKGBUILDDIR>>/src/common/restrictions_input.c: In function ‘pgr_get_restrictions’:
/<<PKGBUILDDIR>>/src/common/restrictions_input.c:124:17: warning: ‘fetch_restriction’ accessing 96 bytes in a region of size 64 [-Wstringop-overflow=]
  124 |                 fetch_restriction(&tuple, &tupdesc, info,
      |                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  125 |                         &(*restrictions)[total_tuples - ntuples + t]);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/src/common/restrictions_input.c:124:17: note: referencing argument 3 of type ‘Column_info_t[3]’
/<<PKGBUILDDIR>>/src/common/restrictions_input.c:36:6: note: in a call to function ‘fetch_restriction’
   36 | void fetch_restriction(
      |      ^~~~~~~~~~~~~~~~~
[ 10%] Building C object src/common/CMakeFiles/common.dir/coordinates_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/coordinates_input.c.o -MF CMakeFiles/common.dir/coordinates_input.c.o.d -o CMakeFiles/common.dir/coordinates_input.c.o -c /<<PKGBUILDDIR>>/src/common/coordinates_input.c
[ 11%] Building C object src/common/CMakeFiles/common.dir/arrays_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/arrays_input.c.o -MF CMakeFiles/common.dir/arrays_input.c.o.d -o CMakeFiles/common.dir/arrays_input.c.o -c /<<PKGBUILDDIR>>/src/common/arrays_input.c
[ 11%] Building C object src/common/CMakeFiles/common.dir/delauny_input.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -MD -MT src/common/CMakeFiles/common.dir/delauny_input.c.o -MF CMakeFiles/common.dir/delauny_input.c.o.d -o CMakeFiles/common.dir/delauny_input.c.o -c /<<PKGBUILDDIR>>/src/common/delauny_input.c
[ 12%] Building C object src/common/CMakeFiles/common.dir/check_parameters.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 12%] Building C object src/common/CMakeFiles/common.dir/time_msg.c.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 13%] Building CXX object src/common/CMakeFiles/common.dir/pgr_assert.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 13%] Building CXX object src/common/CMakeFiles/common.dir/identifier.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 14%] Building CXX object src/common/CMakeFiles/common.dir/basic_vertex.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:28:
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:1281: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
 1281 |     __rotate(_RandomAccessIterator __first,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1281: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++/12/bits/stl_algo.h:1281: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++/12/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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/cpp_common/basic_vertex.h:31,
                 from /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:25:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::Basic_vertex>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/bits/stl_algo.h:61:
/usr/include/c++/12/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++/12/bits/stl_tempbuf.h:258: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
  258 |     _Temporary_buffer<_ForwardIterator, _Tp>::
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2352: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
 2352 |     __rotate_adaptive(_BidirectionalIterator1 __first,
      |     ^~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2383:20:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __comp);
      |                             ~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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:103:31:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:106:31:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘std::vector<pgrouting::Basic_vertex> pgrouting::extract_vertices(const std::vector<Edge_t>&)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:112:25:
/usr/include/c++/12/bits/stl_algo.h:4996: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
 4996 |       _TmpBuf __buf(__first, (__last - __first + 1) / 2);
      |               ^~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __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:70:31:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:73:31:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_algo.h:5070: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:79:25:
/usr/include/c++/12/bits/stl_algo.h:4996: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
 4996 |       _TmpBuf __buf(__first, (__last - __first + 1) / 2);
      |               ^~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::Basic_vertex*, std::vector<pgrouting::Basic_vertex> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:45:25:
/usr/include/c++/12/bits/stl_algo.h:4996: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
 4996 |       _TmpBuf __buf(__first, (__last - __first + 1) / 2);
      |               ^~~~~
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::__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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:45:25:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33,
    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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:45:25:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33,
    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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:45:25:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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::__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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:45:25:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<Basic_vertex>)’ at /<<PKGBUILDDIR>>/src/common/basic_vertex.cpp:45:25:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 14%] Building CXX object src/common/CMakeFiles/common.dir/xy_vertex.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/algorithm:61,
                 from /usr/include/boost/array.hpp:51,
                 from /usr/include/boost/geometry/io/wkt/write.hpp:27,
                 from /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:26:
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1281: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
 1281 |     __rotate(_RandomAccessIterator __first,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1281: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++/12/bits/stl_algo.h:1281: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++/12/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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/cpp_common/xy_vertex.h:32,
                 from /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:25:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::XY_vertex>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2352: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
 2352 |     __rotate_adaptive(_BidirectionalIterator1 __first,
      |     ^~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2383:20:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __comp);
      |                             ~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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:92:27:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:95:27:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘std::vector<pgrouting::XY_vertex> pgrouting::extract_vertices(const std::vector<Edge_xy_t>&)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:101:21:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<pgrouting::XY_vertex*, std::vector<pgrouting::XY_vertex> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<XY_vertex>)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:68:21:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __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::__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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<XY_vertex>)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:68:21:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33,
    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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<XY_vertex>)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:68:21:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33,
    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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<XY_vertex>)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:68:21:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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::__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++/12/bits/stl_algo.h:4999:28,
    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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘size_t pgrouting::check_vertices(std::vector<XY_vertex>)’ at /<<PKGBUILDDIR>>/src/common/xy_vertex.cpp:68:21:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
[ 15%] Building CXX object src/common/CMakeFiles/common.dir/ch_vertex.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 15%] Building CXX object src/common/CMakeFiles/common.dir/ch_edge.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 16%] Building CXX object src/common/CMakeFiles/common.dir/basic_edge.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 16%] Building CXX object src/common/CMakeFiles/common.dir/pgr_alloc.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[ 16%] Built target common
make  -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/astar /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/astar /<<PKGBUILDDIR>>/build-14/src/astar/CMakeFiles/astar.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 16%] Building C object src/astar/CMakeFiles/astar.dir/astar.c.o
cd /<<PKGBUILDDIR>>/build-14/src/astar && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 17%] Building CXX object src/astar/CMakeFiles/astar.dir/astar_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/astar && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/astar/astar_driver.cpp:34:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/astar/pgr_astar.hpp:33,
                 from /<<PKGBUILDDIR>>/src/astar/astar_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:
/usr/include/c++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/astar/astar_driver.cpp:35:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> pgrouting::algorithms::Pgr_astar<G>::astar(G&, const std::vector<II_t_rt>&, 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/astar/pgr_astar.hpp:184:38:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> pgrouting::algorithms::Pgr_astar<G>::astar(G&, const std::vector<II_t_rt>&, 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/astar/pgr_astar.hpp:187:45:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:58:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:58:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:63:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:63:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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 ‘std::deque<Path> pgrouting::algorithms::Pgr_astar<G>::astar(G&, const std::vector<II_t_rt>&, 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/astar/pgr_astar.hpp:184:38:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> pgrouting::algorithms::Pgr_astar<G>::astar(G&, const std::vector<II_t_rt>&, 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/astar/pgr_astar.hpp:187:45:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:58:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:58:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:63:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_astar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, bool, 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>>/src/astar/astar_driver.cpp:63:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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>::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:312:30,
    inlined from ‘void do_pgr_astarManyToMany(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:134:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312:30,
    inlined from ‘void do_pgr_astarManyToMany(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:142:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 17%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/driving_distance /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/driving_distance /<<PKGBUILDDIR>>/build-14/src/driving_distance/CMakeFiles/driving_distance.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
[ 17%] Building C object src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_driving_distance.c.o
cd /<<PKGBUILDDIR>>/build-14/src/driving_distance && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 18%] Building C object src/driving_distance/CMakeFiles/driving_distance.dir/many_to_dist_withPointsDD.c.o
cd /<<PKGBUILDDIR>>/build-14/src/driving_distance && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 18%] Building CXX object src/driving_distance/CMakeFiles/driving_distance.dir/drivedist_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/driving_distance && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:31:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:29:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:574:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:574:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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::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/pgr_dijkstra.hpp:508:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:701:41:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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::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/pgr_dijkstra.hpp:508:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:701:41:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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>::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:312:30,
    inlined from ‘void do_pgr_driving_many_to_dist(Edge_t*, size_t, int64_t*, size_t, double, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:124:61:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312:30,
    inlined from ‘void do_pgr_driving_many_to_dist(Edge_t*, size_t, int64_t*, size_t, double, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/driving_distance/drivedist_driver.cpp:155:65:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 19%] Building CXX object src/driving_distance/CMakeFiles/driving_distance.dir/withPoints_dd_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/driving_distance && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/src/driving_distance/withPoints_dd_driver.cpp:38:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/driving_distance/withPoints_dd_driver.cpp:35:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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::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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:574:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_with_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:574:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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::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/pgr_dijkstra.hpp:508:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:701:41:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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::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/pgr_dijkstra.hpp:508:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::drivingDistance_no_equicost(G&, const std::vector<long long int>&, 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/pgr_dijkstra.hpp:701:41:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 19%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ksp /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/ksp /<<PKGBUILDDIR>>/build-14/src/ksp/CMakeFiles/ksp.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/ksp/CMakeFiles/ksp.dir/build.make src/ksp/CMakeFiles/ksp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 19%] Building C object src/ksp/CMakeFiles/ksp.dir/ksp.c.o
cd /<<PKGBUILDDIR>>/build-14/src/ksp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 20%] Building CXX object src/ksp/CMakeFiles/ksp.dir/ksp_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/ksp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:29,
                 from /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:
/usr/include/c++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:30:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/deque:63,
                 from /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:29:
/usr/include/c++/12/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’:
/usr/include/c++/12/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  113 |     __do_uninit_copy(_InputIterator __first, _InputIterator __last,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In file included from /usr/include/c++/12/deque:67:
/usr/include/c++/12/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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  443 |       deque<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _ForwardIterator = Path*; bool _TrivialValueTypes = false]’,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’ at /usr/include/c++/12/bits/stl_uninitialized.h:185:15,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*; _Tp = Path]’ at /usr/include/c++/12/bits/stl_uninitialized.h:372:37,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:462:30:
/usr/include/c++/12/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _ForwardIterator = Path*; bool _TrivialValueTypes = false]’,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’ at /usr/include/c++/12/bits/stl_uninitialized.h:185:15,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*; _Tp = Path]’ at /usr/include/c++/12/bits/stl_uninitialized.h:372:37,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:466:33:
/usr/include/c++/12/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  137 |         { return std::__do_uninit_copy(__first, __last, __result); }
      |                  ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>]’:
/usr/include/c++/12/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  163 |     uninitialized_copy(_InputIterator __first, _InputIterator __last,
      |     ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
/usr/include/c++/12/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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  771 |       deque<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Tp = Path]’,
    inlined from ‘_ForwardIterator std::__uninitialized_move_copy(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = _Deque_iterator<Path, Path&, Path*>; _InputIterator2 = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Allocator = allocator<Path>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:523:72,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:800:7:
/usr/include/c++/12/bits/stl_uninitialized.h:372:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Tp = Path]’,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_move(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = _Rb_tree_const_iterator<Path>; _InputIterator2 = _Deque_iterator<Path, Path&, Path*>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Allocator = allocator<Path>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:490:24,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:840:5:
/usr/include/c++/12/bits/stl_uninitialized.h:372:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
In file included from /usr/include/c++/12/deque:64:
/usr/include/c++/12/bits/stl_deque.h: In member function ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1730 |         insert(const_iterator __position, _InputIterator __first,
      |         ^~~~~~
/usr/include/c++/12/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’,
    inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/stl_deque.h:1734:23:
/usr/include/c++/12/bits/deque.tcc:638:24: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  638 |           _M_insert_aux(__pos, __first, __last, __n);
      |           ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’,
    inlined from ‘std::deque<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:207:27,
    inlined from ‘std::deque<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:100:15,
    inlined from ‘void do_pgr_ksp(Edge_t*, size_t, int64_t, int64_t, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:75:31:
/usr/include/c++/12/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1007 |           _M_range_initialize(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1008 |                               std::__iterator_category(__first));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::deque<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<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:100:15,
    inlined from ‘void do_pgr_ksp(Edge_t*, size_t, int64_t, int64_t, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:75:31:
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  210 |             paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
      |             ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’,
    inlined from ‘std::deque<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:207:27,
    inlined from ‘std::deque<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:100:15,
    inlined from ‘void do_pgr_ksp(Edge_t*, size_t, int64_t, int64_t, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:80:31:
/usr/include/c++/12/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1007 |           _M_range_initialize(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1008 |                               std::__iterator_category(__first));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::deque<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<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:100:15,
    inlined from ‘void do_pgr_ksp(Edge_t*, size_t, int64_t, int64_t, size_t, bool, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/ksp_driver.cpp:80:31:
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  210 |             paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
      |             ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
[ 20%] Building C object src/ksp/CMakeFiles/ksp.dir/withPoints_ksp.c.o
cd /<<PKGBUILDDIR>>/build-14/src/ksp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 21%] Building CXX object src/ksp/CMakeFiles/ksp.dir/withPoints_ksp_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/ksp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:29,
                 from /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:
/usr/include/c++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp:35:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/deque:63,
                 from /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp:34:
/usr/include/c++/12/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’:
/usr/include/c++/12/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  113 |     __do_uninit_copy(_InputIterator __first, _InputIterator __last,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In file included from /usr/include/c++/12/deque:67:
/usr/include/c++/12/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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  443 |       deque<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/deque.tcc:443:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _ForwardIterator = Path*; bool _TrivialValueTypes = false]’,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’ at /usr/include/c++/12/bits/stl_uninitialized.h:185:15,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*; _Tp = Path]’ at /usr/include/c++/12/bits/stl_uninitialized.h:372:37,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:462:30:
/usr/include/c++/12/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _ForwardIterator = Path*; bool _TrivialValueTypes = false]’,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’ at /usr/include/c++/12/bits/stl_uninitialized.h:185:15,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*; _Tp = Path]’ at /usr/include/c++/12/bits/stl_uninitialized.h:372:37,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:466:33:
/usr/include/c++/12/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  137 |         { return std::__do_uninit_copy(__first, __last, __result); }
      |                  ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>]’:
/usr/include/c++/12/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  163 |     uninitialized_copy(_InputIterator __first, _InputIterator __last,
      |     ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ 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 = 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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
/usr/include/c++/12/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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  771 |       deque<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Tp = Path]’,
    inlined from ‘_ForwardIterator std::__uninitialized_move_copy(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = _Deque_iterator<Path, Path&, Path*>; _InputIterator2 = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Allocator = allocator<Path>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:523:72,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:800:7:
/usr/include/c++/12/bits/stl_uninitialized.h:372:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Tp = Path]’,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_move(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = _Rb_tree_const_iterator<Path>; _InputIterator2 = _Deque_iterator<Path, Path&, Path*>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Allocator = allocator<Path>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:490:24,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:840:5:
/usr/include/c++/12/bits/stl_uninitialized.h:372:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
In file included from /usr/include/c++/12/deque:64:
/usr/include/c++/12/bits/stl_deque.h: In member function ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1730 |         insert(const_iterator __position, _InputIterator __first,
      |         ^~~~~~
/usr/include/c++/12/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’,
    inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/stl_deque.h:1734:23:
/usr/include/c++/12/bits/deque.tcc:638:24: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  638 |           _M_insert_aux(__pos, __first, __last, __n);
      |           ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’,
    inlined from ‘std::deque<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:207:27:
/usr/include/c++/12/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1007 |           _M_range_initialize(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1008 |                               std::__iterator_category(__first));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp: In member function ‘std::deque<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>]’:
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  210 |             paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
      |             ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 = 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:312:30,
    inlined from ‘int do_pgr_withPointsKsp(Edge_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t, int64_t, size_t, bool, bool, char, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp:124:61:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’,
    inlined from ‘std::deque<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:207:27,
    inlined from ‘std::deque<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:100:15,
    inlined from ‘int do_pgr_withPointsKsp(Edge_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t, int64_t, size_t, bool, bool, char, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp:143:31:
/usr/include/c++/12/bits/stl_deque.h:1007:30: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1007 |           _M_range_initialize(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1008 |                               std::__iterator_category(__first));
      |                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘std::deque<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<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:100:15,
    inlined from ‘int do_pgr_withPointsKsp(Edge_t*, size_t, Point_on_edge_t*, size_t, Edge_t*, size_t, int64_t, int64_t, size_t, bool, bool, char, bool, Path_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/ksp/withPoints_ksp_driver.cpp:143:31:
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  210 |             paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
      |             ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
[ 21%] Building C object src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath.c.o
cd /<<PKGBUILDDIR>>/build-14/src/ksp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 22%] Building CXX object src/ksp/CMakeFiles/ksp.dir/turnRestrictedPath_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/ksp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/deque:63,
                 from /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp:33:
/usr/include/c++/12/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’:
/usr/include/c++/12/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  113 |     __do_uninit_copy(_InputIterator __first, _InputIterator __last,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In file included from /usr/include/c++/12/deque:64:
/usr/include/c++/12/bits/stl_deque.h: In constructor ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/stl_deque.h:1003:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1003 |         deque(_InputIterator __first, _InputIterator __last,
      |         ^~~~~
/usr/include/c++/12/bits/stl_deque.h:1003:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _ForwardIterator = Path*; bool _TrivialValueTypes = false]’,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’ at /usr/include/c++/12/bits/stl_uninitialized.h:185:15,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*; _Tp = Path]’ at /usr/include/c++/12/bits/stl_uninitialized.h:372:37,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:462:30,
    inlined from ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/stl_deque.h:1007:23:
/usr/include/c++/12/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _ForwardIterator = Path*; bool _TrivialValueTypes = false]’,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*]’ at /usr/include/c++/12/bits/stl_uninitialized.h:185:15,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = Path*; _Tp = Path]’ at /usr/include/c++/12/bits/stl_uninitialized.h:372:37,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_range_initialize(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:466:33,
    inlined from ‘std::deque<_Tp, _Alloc>::deque(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/stl_deque.h:1007:23:
/usr/include/c++/12/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  137 |         { return std::__do_uninit_copy(__first, __last, __result); }
      |                  ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h: In function ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>]’:
/usr/include/c++/12/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  163 |     uninitialized_copy(_InputIterator __first, _InputIterator __last,
      |     ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_uninitialized.h:163:5: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In file included from /usr/include/c++/12/deque:67:
/usr/include/c++/12/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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  771 |       deque<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/deque.tcc:771:7: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Tp = Path]’,
    inlined from ‘_ForwardIterator std::__uninitialized_move_copy(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = _Deque_iterator<Path, Path&, Path*>; _InputIterator2 = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Allocator = allocator<Path>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:523:72,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:800:7:
/usr/include/c++/12/bits/stl_uninitialized.h:372:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
In function ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = _Rb_tree_const_iterator<Path>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Tp = Path]’,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_move(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _ForwardIterator, _Allocator&) [with _InputIterator1 = _Rb_tree_const_iterator<Path>; _InputIterator2 = _Deque_iterator<Path, Path&, Path*>; _ForwardIterator = _Deque_iterator<Path, Path&, Path*>; _Allocator = allocator<Path>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:490:24,
    inlined from ‘void std::deque<_Tp, _Alloc>::_M_insert_aux(iterator, _ForwardIterator, _ForwardIterator, size_type) [with _ForwardIterator = std::_Rb_tree_const_iterator<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/deque.tcc:840:5:
/usr/include/c++/12/bits/stl_uninitialized.h:372:63: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
/usr/include/c++/12/bits/stl_deque.h: In member function ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’:
/usr/include/c++/12/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
 1730 |         insert(const_iterator __position, _InputIterator __first,
      |         ^~~~~~
/usr/include/c++/12/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<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<Path>; _Tp = Path; _Alloc = std::allocator<Path>]’,
    inlined from ‘std::deque<_Tp, _Alloc>::iterator std::deque<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = std::_Rb_tree_const_iterator<Path>; <template-parameter-2-2> = void; _Tp = Path; _Alloc = std::allocator<Path>]’ at /usr/include/c++/12/bits/stl_deque.h:1734:23:
/usr/include/c++/12/bits/deque.tcc:638:24: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  638 |           _M_insert_aux(__pos, __first, __last, __n);
      |           ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/ksp/turnRestrictedPath_driver.cpp:44:
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<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<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<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<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:207:27: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  207 |          std::deque<Path> paths(m_ResultSet.begin(), m_ResultSet.end());
      |                           ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  210 |             paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
      |             ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<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<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>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<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<Path>’ changed in GCC 7.1
  190 |              std::deque<Path> solutions(m_solutions.begin(), m_solutions.end());
      |                               ^~~~~~~~~
In member function ‘std::deque<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<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:207:27: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  207 |          std::deque<Path> paths(m_ResultSet.begin(), m_ResultSet.end());
      |                           ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
  210 |             paths.insert(paths.end(), m_Heap.begin(), m_Heap.end());
      |             ^~~~~
/<<PKGBUILDDIR>>/include/yen/pgr_ksp.hpp:210:13: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<Path>’ changed in GCC 7.1
/<<PKGBUILDDIR>>/include/yen/pgr_turnRestrictedPath.hpp: In member function ‘std::deque<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<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++/12/bits/stl_vector.h:1294: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:113:31:
/usr/include/c++/12/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-14'
[ 22%] Built target ksp
make  -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/tsp /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/tsp /<<PKGBUILDDIR>>/build-14/src/tsp/CMakeFiles/tsp.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 23%] Building C object src/tsp/CMakeFiles/tsp.dir/euclideanTSP.c.o
cd /<<PKGBUILDDIR>>/build-14/src/tsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 23%] Building C object src/tsp/CMakeFiles/tsp.dir/TSP.c.o
cd /<<PKGBUILDDIR>>/build-14/src/tsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 24%] Building CXX object src/tsp/CMakeFiles/tsp.dir/tsp.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/tsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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:231: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]
  231 |     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:304:29: warning: conversion to ‘int’ from ‘size_t’ {aka ‘unsigned int’} may change the sign of the result [-Wsign-conversion]
  304 |         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:392:29: warning: conversion to ‘int’ from ‘size_t’ {aka ‘unsigned int’} may change the sign of the result [-Wsign-conversion]
  392 |         auto v = add_vertex(i, graph);
      |                             ^
In file included from /<<PKGBUILDDIR>>/src/tsp/tsp.cpp:28:
/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,
      |      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 24%] Building CXX object src/tsp/CMakeFiles/tsp.dir/TSP_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/tsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 25%] Building CXX object src/tsp/CMakeFiles/tsp.dir/euclideanTSP_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/tsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[ 25%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/alpha_shape /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/alpha_shape /<<PKGBUILDDIR>>/build-14/src/alpha_shape/CMakeFiles/alpha_shape.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
[ 26%] Building CXX object src/alpha_shape/CMakeFiles/alpha_shape.dir/pgr_alphaShape.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/alpha_shape && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/map:60,
                 from /<<PKGBUILDDIR>>/include/alphaShape/pgr_alphaShape.h:38,
                 from /<<PKGBUILDDIR>>/src/alpha_shape/pgr_alphaShape.cpp:28:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2209: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
 2209 |     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/alphaShape/pgr_alphaShape.h:37:
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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:140: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:403:83:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:146: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:403:83:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:150: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:403:83:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:150: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:403:83:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:451:27:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61:
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:255:37:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:257:36:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:287:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:302:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:304:55:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 26%] Building C object src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape.c.o
cd /<<PKGBUILDDIR>>/build-14/src/alpha_shape && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 27%] Building CXX object src/alpha_shape/CMakeFiles/alpha_shape.dir/alphaShape_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/alpha_shape && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/algorithm:61,
                 from /usr/include/boost/array.hpp:51,
                 from /usr/include/boost/geometry/io/wkt/write.hpp:27,
                 from /<<PKGBUILDDIR>>/src/alpha_shape/alphaShape_driver.cpp:29:
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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++/12/bits/stl_algo.h:1782: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
 1782 |     __unguarded_linear_insert(_RandomAccessIterator __last,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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 file included from /usr/include/c++/12/bits/stl_algo.h:60:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1281: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
 1281 |     __rotate(_RandomAccessIterator __first,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1281: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++/12/bits/stl_algo.h:1281: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++/12/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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           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++/12/bits/stl_algo.h:2748: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749: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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:2352: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
 2352 |     __rotate_adaptive(_BidirectionalIterator1 __first,
      |     ^~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2383:20:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __comp);
      |                             ~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_xy_t*, std::vector<Edge_xy_t> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __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++/12/bits/stl_algo.h:4853: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:92:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4853: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:92:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:5070: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:97:25:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_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++/12/bits/stl_algo.h:5070: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:116:25:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 27%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdAstar /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/bdAstar /<<PKGBUILDDIR>>/build-14/src/bdAstar/CMakeFiles/bdAstar.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/bdAstar/CMakeFiles/bdAstar.dir/build.make src/bdAstar/CMakeFiles/bdAstar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 27%] Building C object src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar.c.o
cd /<<PKGBUILDDIR>>/build-14/src/bdAstar && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 28%] Building CXX object src/bdAstar/CMakeFiles/bdAstar.dir/bdAstar_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/bdAstar && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:35:
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:60:
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/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++/12/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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:902: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
  902 |     __unique(_ForwardIterator __first, _ForwardIterator __last,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:902: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1281: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
 1281 |     __rotate(_RandomAccessIterator __first,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1281: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++/12/bits/stl_algo.h:1281: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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:40,
                 from /<<PKGBUILDDIR>>/include/bdAstar/pgr_bdAstar.hpp:35,
                 from /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/bdAstar/bdAstar_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
/usr/include/c++/12/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++/12/bits/stl_algo.h:2352: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
 2352 |     __rotate_adaptive(_BidirectionalIterator1 __first,
      |     ^~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2383:20:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __comp);
      |                             ~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __comp);
      |                             ~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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::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:520: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:949:22:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950:22:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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:108:28:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:109:28:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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:114:29:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:115:29:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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:108:28:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:109:28:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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:114:29:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:115:29:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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
  439 |       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++/12/bits/stl_vector.h:1294: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++/12/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/pgr_bdAstar.hpp:121:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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/pgr_bdAstar.hpp:121:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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/pgr_bdAstar.hpp:147:36:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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/pgr_bdAstar.hpp:147:36:
/usr/include/c++/12/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++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2748:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’,
    inlined from ‘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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:2749:33:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __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::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:520: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:949:22:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950:22:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
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++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:128:27:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:132:28:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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/pgr_bdAstar.hpp:121:35,
    inlined from ‘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:158:36:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:128:27:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:132:28:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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/pgr_bdAstar.hpp:121:35,
    inlined from ‘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:158:36:
/usr/include/c++/12/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 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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:75:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:75:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:77:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:80:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:80:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:82:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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 = pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:102:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:1940:31,
    inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:102:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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 = pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:5070:36,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:106:25:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:75:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:75:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:77:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:80:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:80:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:82:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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 = pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:102:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:1940:31,
    inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:102:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, 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 = pgr_bdAstar<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> >(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>&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, bool)::<lambda(const II_t_rt&, const II_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:5070:36,
    inlined from ‘std::deque<Path> pgr_bdAstar(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, int, double, double, std::ostream&, 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>>/src/bdAstar/bdAstar_driver.cpp:106:25:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_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>::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:312:30,
    inlined from ‘void do_pgr_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:193:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312:30,
    inlined from ‘void do_pgr_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:209:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 28%] Built target bdAstar
make  -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdDijkstra /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/bdDijkstra /<<PKGBUILDDIR>>/build-14/src/bdDijkstra/CMakeFiles/bdDijkstra.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 28%] Building C object src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra.c.o
cd /<<PKGBUILDDIR>>/build-14/src/bdDijkstra && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 29%] Building CXX object src/bdDijkstra/CMakeFiles/bdDijkstra.dir/bdDijkstra_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/bdDijkstra && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:35:
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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<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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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<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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:60:
/usr/include/c++/12/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<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++/12/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++/12/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<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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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<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++/12/bits/stl_algo.h:2615: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
 2615 |     __move_merge(_InputIterator __first1, _InputIterator __last1,
      |     ^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/bits/stl_algo.h:2615: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++/12/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<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++/12/bits/stl_algo.h:2615: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++/12/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++/12/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++/12/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<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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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<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<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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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<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<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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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<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<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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:2682: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
 2682 |     __merge_sort_with_buffer(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2682: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<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<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++/12/bits/stl_algo.h:2693:34:
/usr/include/c++/12/bits/stl_algo.h:2672: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
 2672 |           std::__insertion_sort(__first, __first + __chunk_size, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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
 2675 |       std::__insertion_sort(__first, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2675: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<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<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++/12/bits/stl_algo.h:2697:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2650: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++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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<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<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++/12/bits/stl_algo.h:2700:26:
/usr/include/c++/12/bits/stl_algo.h:2650: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
 2650 |           __result = std::__move_merge(__first, __first + __step_size,
      |                      ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2651 |                                        __first + __step_size,
      |                                        ~~~~~~~~~~~~~~~~~~~~~~
 2652 |                                        __first + __two_step,
      |                                        ~~~~~~~~~~~~~~~~~~~~~
 2653 |                                        __result, __comp);
      |                                        ~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2658: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
 2658 |       std::__move_merge(__first, __first + __step_size,
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2659 |                         __first + __step_size, __last, __result, __comp);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:902: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
  902 |     __unique(_ForwardIterator __first, _ForwardIterator __last,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:902: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/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++/12/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<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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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<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++/12/bits/stl_algo.h:1802: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++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1281: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
 1281 |     __rotate(_RandomAccessIterator __first,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1281: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++/12/bits/stl_algo.h:1281: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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/cpp_common/pgr_bidirectional.hpp:40,
                 from /<<PKGBUILDDIR>>/include/bdDijkstra/pgr_bdDijkstra.hpp:31,
                 from /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/bdDijkstra/bdDijkstra_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
/usr/include/c++/12/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++/12/bits/stl_algo.h:2352: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
 2352 |     __rotate_adaptive(_BidirectionalIterator1 __first,
      |     ^~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2352: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++/12/bits/stl_algo.h:2383:20:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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<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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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<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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __comp);
      |                             ~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__merge_adaptive(_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<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++/12/bits/stl_algo.h:2390: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
 2390 |     __merge_adaptive(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2390: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++/12/bits/stl_algo.h:2435: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
 2435 |             = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
      |               ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2436 |                                      __len1 - __len11, __len22, __buffer,
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2437 |                                      __buffer_size);
      |                                      ~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2438: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
 2438 |           std::__merge_adaptive(__first, __first_cut, __new_middle, __len11,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2439 |                                 __len22, __buffer, __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2440: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
 2440 |           std::__merge_adaptive(__new_middle, __second_cut, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2441 |                                 __len1 - __len11,
      |                                 ~~~~~~~~~~~~~~~~~
 2442 |                                 __len2 - __len22, __buffer,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2443 |                                 __buffer_size, __comp);
      |                                 ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__stable_sort_adaptive(_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<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++/12/bits/stl_algo.h:2709: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
 2709 |     __stable_sort_adaptive(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2709: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++/12/bits/stl_algo.h:2718:38: 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
 2718 |           std::__stable_sort_adaptive(__first, __middle, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2719 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2720:38: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2720 |           std::__stable_sort_adaptive(__middle, __last, __buffer,
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2721 |                                       __buffer_size, __comp);
      |                                       ~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2725:40: 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
 2725 |           std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2726:40: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<II_t_rt*, std::vector<II_t_rt> >’ changed in GCC 7.1
 2726 |           std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2729:28: 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
 2729 |       std::__merge_adaptive(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2730 |                             _Distance(__middle - __first),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2731 |                             _Distance(__last - __middle),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2732 |                             __buffer, __buffer_size,
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~
 2733 |                             __comp);
      |                             ~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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:108:28:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:109:28:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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:114:29:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:115:29:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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:108:28:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:109:28:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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:114:29:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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:115:29:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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
  439 |       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++/12/bits/stl_vector.h:1294: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++/12/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:113:36:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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:113:36:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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:136:37:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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:136:37:
/usr/include/c++/12/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++/12/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<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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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<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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:2451: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
 2451 |     __merge_without_buffer(_BidirectionalIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2451: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++/12/bits/stl_algo.h:2451: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<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++/12/bits/stl_algo.h:2491:15:
/usr/include/c++/12/bits/stl_algo.h:1397: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
 1397 |       return std::__rotate(__first, __middle, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 1398 |                            std::__iterator_category(__first));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:2492: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
 2492 |       std::__merge_without_buffer(__first, __first_cut, __new_middle,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2493 |                                   __len11, __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2494: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
 2494 |       std::__merge_without_buffer(__new_middle, __second_cut, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2495 |                                   __len1 - __len11, __len2 - __len22, __comp);
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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<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++/12/bits/stl_algo.h:2739: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
 2739 |     __inplace_stable_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2739: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++/12/bits/stl_algo.h:2744: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
 2744 |           std::__insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2748: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
 2748 |       std::__inplace_stable_sort(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2749: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
 2749 |       std::__inplace_stable_sort(__middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:2750: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
 2750 |       std::__merge_without_buffer(__first, __middle, __last,
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
 2751 |                                   __middle - __first,
      |                                   ~~~~~~~~~~~~~~~~~~~
 2752 |                                   __last - __middle,
      |                                   ~~~~~~~~~~~~~~~~~~
 2753 |                                   __comp);
      |                                   ~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, unsigned int>}; _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’,
    inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, unsigned int>; _Alloc = std::allocator<std::pair<double, unsigned int> >]’ at /usr/include/c++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:128:27:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:132:28:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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:136:37,
    inlined from ‘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:150:37:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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:113:36,
    inlined from ‘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:158:36:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:128:27:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/bits/stl_queue.h:748:13,
    inlined from ‘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:132:28:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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:136:37,
    inlined from ‘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:150:37:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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++/12/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:113:36,
    inlined from ‘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:158:36:
/usr/include/c++/12/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 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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:70:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:70:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<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 = 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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> 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:91:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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<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<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++/12/bits/stl_algo.h:1940:31,
    inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = 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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> 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:91:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<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 = 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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘std::deque<Path> 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:95:25:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:70:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:70:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:28:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<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 = 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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> 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:91:18:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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<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<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++/12/bits/stl_algo.h:1940:31,
    inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<II_t_rt*, vector<II_t_rt> >; _Compare = 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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::deque<Path> 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:91:18:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<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 = 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++/12/bits/stl_algo.h:5070:36,
    inlined from ‘std::deque<Path> 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:95:25:
/usr/include/c++/12/bits/stl_algo.h:5001: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
 5001 |         std::__stable_sort_adaptive(__first, __last, __buf.begin(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 5002 |                                     _DistanceType(__buf.size()), __comp);
      |                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:4999: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
 4999 |         std::__inplace_stable_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:520: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:949: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:408: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:361: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:174:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:174:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:184:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:184:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 29%] Built target bdDijkstra
make  -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/trsp /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/trsp /<<PKGBUILDDIR>>/build-14/src/trsp/CMakeFiles/trsp.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 29%] Building C object src/trsp/CMakeFiles/trsp.dir/trsp.c.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/trsp/trsp.c: In function ‘compute_trsp’:
/<<PKGBUILDDIR>>/src/trsp/trsp.c:250:45: warning: conversion to ‘long int’ from ‘uint32_t’ {aka ‘unsigned int’} may change the sign of the result [-Wsign-conversion]
  250 |           SPI_cursor_fetch(SPIportal, true, TUPLIMIT);
      |                                             ^~~~~~~~
[ 30%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trsp_core.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/trsp/trsp_core.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {std::pair<double, std::vector<long long int, std::allocator<long long int> > >}; _Tp = std::pair<double, std::vector<long long int> >; _Alloc = std::allocator<std::pair<double, std::vector<long long int> > >]’:
/usr/include/c++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<std::pair<double, 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++/12/bits/stl_vector.h:1294: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++/12/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++/12/bits/stl_vector.h:1294: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++/12/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++/12/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++/12/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++/12/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++/12/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
In member function ‘void std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {std::pair<double, std::vector<long long int, std::allocator<long long int> > >}; _Tp = std::pair<double, std::vector<long long int> >; _Alloc = std::allocator<std::pair<double, std::vector<long long int> > >]’,
    inlined from ‘void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<double, std::vector<long long int> >; _Alloc = std::allocator<std::pair<double, std::vector<long long int> > >]’ at /usr/include/c++/12/bits/stl_vector.h:1294: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:66:32:
/usr/include/c++/12/bits/vector.tcc:123:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<std::pair<double, std::vector<long long int> >*, std::vector<std::pair<double, std::vector<long long int> > > >’ changed in GCC 7.1
  123 |           _M_realloc_insert(end(), std::forward<_Args>(__args)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 30%] Building CXX object src/trsp/CMakeFiles/trsp.dir/GraphDefinition.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/queue:62,
                 from /<<PKGBUILDDIR>>/include/trsp/GraphDefinition.h:35,
                 from /<<PKGBUILDDIR>>/src/trsp/GraphDefinition.cpp:26:
/usr/include/c++/12/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++/12/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++/12/map:60,
                 from /<<PKGBUILDDIR>>/include/trsp/GraphDefinition.h:34:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/trsp/GraphDefinition.h:33:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<path_element_tt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61:
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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _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::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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/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 = 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++/12/bits/stl_tree.h:2209:5: 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
 2209 |     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Rule>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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++/12/bits/stl_vector.h:1294: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++/12/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++/12/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++/12/bits/stl_vector.h:1294: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++/12/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++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1294: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++/12/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++/12/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++/12/bits/stl_vector.h:1294: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++/12/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++/12/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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1294: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++/12/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++/12/bits/stl_vector.h:1294: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++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1294: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++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         std::tuple<>());
      |                                         ~~~~~~~~~~~~~~~
[ 31%] Building C object src/trsp/CMakeFiles/trsp.dir/new_trsp.c.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 31%] Building CXX object src/trsp/CMakeFiles/trsp.dir/edgeInfo.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 32%] Building CXX object src/trsp/CMakeFiles/trsp.dir/pgr_trspHandler.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/trsp/pgr_trspHandler.h:31,
                 from /<<PKGBUILDDIR>>/src/trsp/pgr_trspHandler.cpp:28:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::EdgeInfo>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:60,
                 from /<<PKGBUILDDIR>>/include/trsp/pgr_trspHandler.h:33:
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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++/12/map:61:
/usr/include/c++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:101:40:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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
  439 |       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++/12/bits/stl_vector.h:1294: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++/12/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++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _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::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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 32%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trsp_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 from /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:38:
/usr/include/c++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/trsp/trsp_driver.cpp:31:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::set<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:216:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::map<long long int, std::set<long long int> >&, bool, 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/dijkstra/pgr_dijkstra.hpp:360:18:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::set<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:216:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::map<long long int, std::set<long long int> >&, bool, 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/dijkstra/pgr_dijkstra.hpp:360:18:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 = 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:312: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:131:61:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312: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:138:65:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1294: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:168:31:
/usr/include/c++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 33%] Building C object src/trsp/CMakeFiles/trsp.dir/trsp_withPoints.c.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 33%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trsp_withPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:39:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_driver.cpp:33:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 from /<<PKGBUILDDIR>>/src/trsp/trsp_withPoints_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 = 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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::set<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:216:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::map<long long int, std::set<long long int> >&, bool, 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/dijkstra/pgr_dijkstra.hpp:360:18:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::set<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:216:26,
    inlined from ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::map<long long int, std::set<long long int> >&, bool, 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/dijkstra/pgr_dijkstra.hpp:360:18:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 = 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:312: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:156:61:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312: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:164:65:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1294: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:213:31:
/usr/include/c++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 34%] Building C object src/trsp/CMakeFiles/trsp.dir/trspVia.c.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 34%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trspVia_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:36,
                 from /<<PKGBUILDDIR>>/src/trsp/trspVia_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/trsp/trspVia_driver.cpp:29:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:
/usr/include/c++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     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 ‘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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_vector.h:1294: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:202:31:
/usr/include/c++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 35%] Building C object src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints.c.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 35%] Building CXX object src/trsp/CMakeFiles/trsp.dir/trspVia_withPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/trsp && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:36,
                 from /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/trsp/trspVia_withPoints_driver.cpp:29:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::trsp::Rule>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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 ‘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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 = 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:312: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:196:61:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312: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:207:65:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1294: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:244:31:
/usr/include/c++/12/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-14'
[ 35%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/max_flow /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/max_flow /<<PKGBUILDDIR>>/build-14/src/max_flow/CMakeFiles/max_flow.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
[ 36%] Building C object src/max_flow/CMakeFiles/max_flow.dir/max_flow.c.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 36%] Building C object src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow.c.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 37%] Building C object src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching.c.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 37%] Building C object src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths.c.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 38%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/max_flow_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /<<PKGBUILDDIR>>/src/max_flow/max_flow_driver.cpp:34:
/usr/include/c++/12/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 = 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++/12/bits/stl_tree.h:2209: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
 2209 |     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:33,
                 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:35:
/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:75: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:107: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:93: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:111: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
[ 38%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/maximum_cardinality_matching_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /usr/include/boost/move/algorithm.hpp:32,
                 from /usr/include/boost/move/move.hpp:32,
                 from /usr/include/boost/unordered/unordered_set.hpp:19,
                 from /usr/include/boost/unordered_set.hpp:17,
                 from /usr/include/boost/graph/adjacency_list.hpp:20,
                 from /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:38,
                 from /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp:39:
/usr/include/c++/12/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Distance = int; _Tp = Edge_bool_t_rt; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
  224 |     __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
      |     ^~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1802:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
In file included from /usr/include/c++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp:37:
/usr/include/c++/12/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {const Edge_bool_t_rt&}; _Tp = Edge_bool_t_rt; _Alloc = std::allocator<Edge_bool_t_rt>]’:
/usr/include/c++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Edge_bool_t_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)> >]’:
/usr/include/c++/12/bits/stl_algo.h:1908:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
/usr/include/c++/12/bits/stl_algo.h:1922:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:
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:75:23,
    inlined from ‘std::vector<Edge_bool_t_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:135:52:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:75:23,
    inlined from ‘std::vector<Edge_bool_t_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:136:52:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = Edge_bool_t_rt; _Alloc = std::allocator<Edge_bool_t_rt>]’,
    inlined from ‘std::vector<Edge_bool_t_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:138:41:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)> >]’,
    inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Compare = pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::vector<Edge_bool_t_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:141:16:
/usr/include/c++/12/bits/stl_algo.h:1937:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __comp);
      |                                 ~~~~~~~
In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)> >]’,
    inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)> >]’ at /usr/include/c++/12/bits/stl_algo.h:1940:31,
    inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Edge_bool_t_rt*, vector<Edge_bool_t_rt> >; _Compare = pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()::<lambda(const Edge_bool_t_rt&, const Edge_bool_t_rt&)>]’ at /usr/include/c++/12/bits/stl_algo.h:4853:18,
    inlined from ‘std::vector<Edge_bool_t_rt> pgrouting::flow::PgrCardinalityGraph::get_matched_vertices()’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:141:16:
/usr/include/c++/12/bits/stl_algo.h:1849:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_bool_t_rt*, std::vector<Edge_bool_t_rt> >’ changed in GCC 7.1
 1854 |         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:71:24,
    inlined from ‘pgrouting::flow::PgrCardinalityGraph::PgrCardinalityGraph(Edge_bool_t_rt*, size_t)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:96:34,
    inlined from ‘void do_pgr_maximum_cardinality_matching(Edge_bool_t_rt*, size_t, bool, Edge_bool_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp:66:72:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:71:24,
    inlined from ‘pgrouting::flow::PgrCardinalityGraph::PgrCardinalityGraph(Edge_bool_t_rt*, size_t)’ at /<<PKGBUILDDIR>>/include/max_flow/pgr_maximumcardinalitymatching.hpp:97:34,
    inlined from ‘void do_pgr_maximum_cardinality_matching(Edge_bool_t_rt*, size_t, bool, Edge_bool_t_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/max_flow/maximum_cardinality_matching_driver.cpp:66:72:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 39%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/edge_disjoint_paths_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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:35,
                 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:102:55,
    inlined from ‘std::vector<Path_rt> single_execution(std::vector<Edge_t>, int64_t, int64_t, bool)’ at /<<PKGBUILDDIR>>/src/max_flow/edge_disjoint_paths_driver.cpp:65: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:117: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
[ 39%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/minCostMaxFlow_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /<<PKGBUILDDIR>>/src/max_flow/minCostMaxFlow_driver.cpp:35:
/usr/include/c++/12/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 = 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++/12/bits/stl_tree.h:2209: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
 2209 |     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 40%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/pgr_maxflow.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /usr/include/boost/graph/adjacency_list.hpp:16,
                 from /<<PKGBUILDDIR>>/include/max_flow/pgr_flowgraph.hpp:32,
                 from /<<PKGBUILDDIR>>/include/max_flow/pgr_maxflow.hpp:32,
                 from /<<PKGBUILDDIR>>/src/max_flow/pgr_maxflow.cpp:27:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Flow_t>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Flow_t*, std::vector<Flow_t> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Path_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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++/12/bits/stl_vector.h:1294: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++/12/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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ changed in GCC 7.1
 1287 |           _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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 40%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/pgr_flowgraph.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 41%] Building CXX object src/max_flow/CMakeFiles/max_flow.dir/pgr_minCostMaxFlow.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/max_flow && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /usr/include/boost/property_map/vector_property_map.hpp:16,
                 from /usr/include/boost/property_map/property_map.hpp:602,
                 from /usr/include/boost/graph/successive_shortest_path_nonnegative_weights.hpp:19,
                 from /<<PKGBUILDDIR>>/include/max_flow/pgr_minCostMaxFlow.hpp:31,
                 from /<<PKGBUILDDIR>>/src/max_flow/pgr_minCostMaxFlow.cpp:27:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Flow_t>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Flow_t*, std::vector<Flow_t> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 41%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/contraction /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/contraction /<<PKGBUILDDIR>>/build-14/src/contraction/CMakeFiles/contraction.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/contraction/CMakeFiles/contraction.dir/build.make src/contraction/CMakeFiles/contraction.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 42%] Building C object src/contraction/CMakeFiles/contraction.dir/contractGraph.c.o
cd /<<PKGBUILDDIR>>/build-14/src/contraction && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 42%] Building CXX object src/contraction/CMakeFiles/contraction.dir/contractGraph_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/contraction && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/deque:63,
                 from /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:34:
/usr/include/c++/12/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++/12/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++/12/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++/12/string:50,
                 from /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/stl_algobase.h:611: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
  611 |     copy(_II __first, _II __last, _OI __result)
      |     ^~~~
/usr/include/c++/12/bits/stl_algobase.h:611: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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:31,
                 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++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:1098:9: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
 1098 |         _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
      |         ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h:1098: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++/12/set:61:
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 ‘Identifiers<T>& Identifiers<T>::operator+=(const Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:133:21,
    inlined from ‘std::tuple<double, 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++/12/bits/stl_set.h:567:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
  567 |         { _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 ‘Identifiers<T>& Identifiers<T>::operator+=(const Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:133:21,
    inlined from ‘std::tuple<double, 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++/12/bits/stl_set.h:567:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
  567 |         { _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 ‘Identifiers<T>& Identifiers<T>::operator+=(const Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:133:21,
    inlined from ‘Identifiers<long long int> operator+(const Identifiers<long long int>&, const Identifiers<long long int>&)’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:123: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++/12/bits/stl_set.h:567:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
  567 |         { _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 ‘Identifiers<T>& Identifiers<T>::operator+=(const Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:133: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++/12/bits/stl_set.h:567:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
  567 |         { _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 ‘Identifiers<T>& Identifiers<T>::operator+=(const Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:133:21,
    inlined from ‘Identifiers<long long int> operator+(const Identifiers<long long int>&, const Identifiers<long long int>&)’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:123: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++/12/bits/stl_set.h:567:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
  567 |         { _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 ‘Identifiers<T>& Identifiers<T>::operator+=(const Identifiers<T>&) [with T = long long int]’ at /<<PKGBUILDDIR>>/include/cpp_common/identifiers.hpp:133: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++/12/bits/stl_set.h:567:38: note: parameter passing for argument of type ‘std::_Rb_tree_const_iterator<long long int>’ changed in GCC 7.1
  567 |         { _M_t._M_insert_range_unique(__first, __last); }
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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::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:520:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/deque:67:
/usr/include/c++/12/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++/12/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++/12/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++/12/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++/12/bits/stl_uninitialized.h:523: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++/12/bits/deque.tcc:800:7:
/usr/include/c++/12/bits/stl_uninitialized.h:372: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
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_uninitialized.h:490: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++/12/bits/deque.tcc:840:5:
/usr/include/c++/12/bits/stl_uninitialized.h:372: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
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
/usr/include/c++/12/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++/12/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 file included from /usr/include/c++/12/deque:64:
/usr/include/c++/12/bits/stl_deque.h: In member function ‘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>]’:
/usr/include/c++/12/bits/stl_deque.h:1730:9: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
 1730 |         insert(const_iterator __position, _InputIterator __first,
      |         ^~~~~~
/usr/include/c++/12/bits/stl_deque.h:1730:9: 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 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++/12/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++/12/bits/stl_deque.h:1734:23:
/usr/include/c++/12/bits/stl_uninitialized.h:372: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
  372 |       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++/12/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++/12/bits/stl_deque.h:1734:23:
/usr/include/c++/12/bits/stl_uninitialized.h:372: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
  372 |       return std::uninitialized_copy(__first, __last, __result);
      |                                                               ^
In member function ‘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>]’,
    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++/12/bits/stl_deque.h:1734:23:
/usr/include/c++/12/bits/deque.tcc:638: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
  638 |           _M_insert_aux(__pos, __first, __last, __n);
      |           ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:39:
/<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp: In constructor ‘pgrouting::contraction::Pgr_contract<G>::Pgr_contract(G&, 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> >]’:
/<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
   62 |         contract_order.insert(
      |         ^~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
/<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp: In constructor ‘pgrouting::contraction::Pgr_contract<G>::Pgr_contract(G&, 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> >]’:
/<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >’ changed in GCC 7.1
   62 |         contract_order.insert(
      |         ^~~~~~~~~~~~~~
/<<PKGBUILDDIR>>/include/contraction/pgr_contract.hpp:62:9: 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 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:520: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::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:949: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::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:408:28,
    inlined from ‘void {anonymous}::process_contraction(G&, const std::vector<Edge_t>&, const std::vector<long long int>&, const 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>>/src/contraction/contractGraph_driver.cpp:92:23,
    inlined from ‘void do_pgr_contractGraph(Edge_t*, size_t, int64_t*, size_t, int64_t*, size_t, int64_t, bool, contracted_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:241:32:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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::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:950: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::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:408:28,
    inlined from ‘void {anonymous}::process_contraction(G&, const std::vector<Edge_t>&, const std::vector<long long int>&, const 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>>/src/contraction/contractGraph_driver.cpp:92:23,
    inlined from ‘void do_pgr_contractGraph(Edge_t*, size_t, int64_t*, size_t, int64_t*, size_t, int64_t, bool, contracted_rt**, size_t*, char**, char**, char**)’ at /<<PKGBUILDDIR>>/src/contraction/contractGraph_driver.cpp:241:32:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 43%] Building CXX object src/contraction/CMakeFiles/contraction.dir/pgr_contract.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/contraction && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[ 43%] Built target contraction
make  -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/pickDeliver /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/pickDeliver /<<PKGBUILDDIR>>/build-14/src/pickDeliver/CMakeFiles/pickDeliver.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 44%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_orders.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 44%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/fleet.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/vrp/fleet.h:33,
                 from /<<PKGBUILDDIR>>/src/pickDeliver/fleet.cpp:26:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Vehicle_t>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:63:
/usr/include/c++/12/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++/12/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++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:1617: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++/12/bits/vector.tcc:232:44:
/usr/include/c++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:601:31,
    inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:63:6,
    inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:70:6:
/usr/include/c++/12/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++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::vrp::Vehicle_pickDeliver>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294: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++/12/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++/12/bits/stl_vector.h:1294: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++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 45%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pgr_pickDeliver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/vrp/pgr_pickDeliver.h:34,
                 from /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:25:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Schedule_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Schedule_rt*, std::vector<Schedule_rt> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::vrp::Vehicle_node>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:63:
/usr/include/c++/12/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++/12/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++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:1617: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++/12/bits/vector.tcc:232:44:
/usr/include/c++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:601:31,
    inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:63:6,
    inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:70:6,
    inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = pgrouting::vrp::Vehicle_pickDeliver; _Args = {const pgrouting::vrp::Vehicle_pickDeliver&}]’ at /usr/include/c++/12/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++/12/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++/12/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++/12/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++/12/bits/stl_uninitialized.h:372:63:
/usr/include/c++/12/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++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<pgrouting::vrp::Solution>::iterator’ changed in GCC 7.1
  439 |       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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:601:31,
    inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:63:6,
    inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:70:6,
    inlined from ‘void std::_Construct(_Tp*, _Args&& ...) [with _Tp = pgrouting::vrp::Vehicle_pickDeliver; _Args = {pgrouting::vrp::Vehicle_pickDeliver}]’ at /usr/include/c++/12/bits/stl_construct.h:119:7,
    inlined from ‘_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = move_iterator<_Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*> >; _ForwardIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:120:21,
    inlined from ‘static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = std::move_iterator<std::_Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, 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++/12/bits/stl_uninitialized.h:137:58,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = move_iterator<_Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*> >; _ForwardIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:185:41,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = move_iterator<_Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, 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++/12/bits/stl_uninitialized.h:372:63,
    inlined from ‘_ForwardIterator std::__uninitialized_move_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>; _ForwardIterator = _Deque_iterator<pgrouting::vrp::Vehicle_pickDeliver, pgrouting::vrp::Vehicle_pickDeliver&, pgrouting::vrp::Vehicle_pickDeliver*>; _Allocator = allocator<pgrouting::vrp::Vehicle_pickDeliver>]’ at /usr/include/c++/12/bits/stl_uninitialized.h:384:24:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1782: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
 1782 |     __unguarded_linear_insert(_RandomAccessIterator __last,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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
In file included from /usr/include/c++/12/bits/stl_algo.h:60:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           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++/12/bits/stl_vector.h:1294:21,
    inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:59:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294:21,
    inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:67:31:
/usr/include/c++/12/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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:78:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:78:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_vector.h:1294:21,
    inlined from ‘void pgrouting::vrp::Pgr_pickDeliver::solve()’ at /<<PKGBUILDDIR>>/src/pickDeliver/pgr_pickDeliver.cpp:84:24:
/usr/include/c++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 45%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/dnode.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 46%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_pickDeliver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:63,
                 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++/12/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++/12/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++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:601:31,
    inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:63:6,
    inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:70:6:
/usr/include/c++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:1617: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++/12/bits/vector.tcc:232: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++/12/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); }
      |                  ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 46%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/solution.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 47%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/optimize.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/deque:63,
                 from /<<PKGBUILDDIR>>/include/vrp/solution.h:32,
                 from /<<PKGBUILDDIR>>/src/pickDeliver/optimize.cpp:33:
/usr/include/c++/12/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++/12/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++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:601:31,
    inlined from ‘pgrouting::vrp::PD_Orders::PD_Orders(const pgrouting::vrp::PD_Orders&)’ at /<<PKGBUILDDIR>>/include/vrp/pd_orders.h:63:6,
    inlined from ‘pgrouting::vrp::Vehicle_pickDeliver::Vehicle_pickDeliver(const pgrouting::vrp::Vehicle_pickDeliver&)’ at /<<PKGBUILDDIR>>/include/vrp/vehicle_pickDeliver.h:70:6:
/usr/include/c++/12/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++/12/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++/12/bits/stl_uninitialized.h:372: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++/12/bits/stl_vector.h:1617: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++/12/bits/vector.tcc:232: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++/12/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); }
      |                  ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 47%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/tw_node.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 48%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle_node.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 48%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/order.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 49%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/initial_solution.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 49%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/vehicle.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/vrp/vehicle.h:38,
                 from /<<PKGBUILDDIR>>/src/pickDeliver/vehicle.cpp:26:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Schedule_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Schedule_rt*, std::vector<Schedule_rt> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 50%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/map:60,
                 from /<<PKGBUILDDIR>>/src/pickDeliver/pickDeliverEuclidean_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61:
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:90:70:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:91:76:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:72:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:96:68:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:112:87:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:113:96:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:90:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:84:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         std::tuple<>());
      |                                         ~~~~~~~~~~~~~~~
[ 50%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 51%] Building C object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliverEuclidean.c.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 51%] Building C object src/pickDeliver/CMakeFiles/pickDeliver.dir/pickDeliver.c.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 52%] Building CXX object src/pickDeliver/CMakeFiles/pickDeliver.dir/pd_problem.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/pickDeliver && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[ 52%] Built target pickDeliver
make  -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/withPoints /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/withPoints /<<PKGBUILDDIR>>/build-14/src/withPoints/CMakeFiles/withPoints.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 52%] Building C object src/withPoints/CMakeFiles/withPoints.dir/withPoints.c.o
cd /<<PKGBUILDDIR>>/build-14/src/withPoints && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 53%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/get_new_queries.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 53%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/withPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/withPoints/withPoints_driver.cpp:32:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/src/withPoints/withPoints_driver.cpp:40:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/withPoints/withPoints_driver.cpp:35:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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::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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::vector<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:251:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:55:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:55:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:60:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:60:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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 ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:333:37,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:67:10:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:336:44,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:67:10:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, const std::vector<long long int>&, bool, 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/dijkstra/pgr_dijkstra.hpp:251:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:55:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:55:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:60:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:60:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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 ‘std::deque<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:333:37,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:67:10:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> pgrouting::Pgr_dijkstra<G>::dijkstra(G&, const std::vector<II_t_rt>&, bool, 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/dijkstra/pgr_dijkstra.hpp:336:44,
    inlined from ‘std::deque<Path> pgr_dijkstra(G&, std::vector<II_t_rt>&, std::vector<long long int>, std::vector<long long int>, bool, 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/withPoints/withPoints_driver.cpp:67:10:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312: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:61:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312: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:172:65:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 54%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/pgr_withPoints.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/algorithm:61,
                 from /usr/include/boost/move/algorithm.hpp:32,
                 from /usr/include/boost/move/move.hpp:32,
                 from /usr/include/boost/unordered/unordered_set.hpp:19,
                 from /usr/include/boost/unordered_set.hpp:17,
                 from /usr/include/boost/graph/adjacency_list.hpp:20,
                 from /<<PKGBUILDDIR>>/include/cpp_common/basePath_SSEC.hpp:33,
                 from /<<PKGBUILDDIR>>/include/withPoints/pgr_withPoints.hpp:36,
                 from /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:31:
/usr/include/c++/12/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++/12/bits/stl_algo.h:1782: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
 1782 |     __unguarded_linear_insert(_RandomAccessIterator __last,
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/bits/stl_algo.h:60:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘void pgrouting::Pg_points_graph::check_points()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:117:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4853:18,
    inlined from ‘void pgrouting::Pg_points_graph::check_points()’ at /<<PKGBUILDDIR>>/src/withPoints/pgr_withPoints.cpp:117:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         std::__insertion_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/withPoints/pgr_withPoints.hpp:32:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Point_on_edge_t>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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++/12/vector:64:
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:394:33:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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:417:46:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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:434:46:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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:464:42:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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:488:38:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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:508:34:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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:518:34:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 54%] Building C object src/withPoints/CMakeFiles/withPoints.dir/withPointsVia.c.o
cd /<<PKGBUILDDIR>>/build-14/src/withPoints && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 55%] Building CXX object src/withPoints/CMakeFiles/withPoints.dir/withPointsVia_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/withPoints && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstraVia.hpp:36,
                 from /<<PKGBUILDDIR>>/src/withPoints/withPointsVia_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:
/usr/include/c++/12/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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/withPoints/withPointsVia_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     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 ‘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:917:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:923:21:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408:28:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator<double>]’,
    inlined from ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 ‘Path pgrouting::Pgr_dijkstra<G>::dijkstra(G&, int64_t, int64_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/dijkstra/pgr_dijkstra.hpp:180:26,
    inlined from ‘Path pgrouting::pgr_dijkstra(G&, int64_t, int64_t, bool) [with G = graph::Pgr_base_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Basic_vertex, Basic_edge>, Basic_vertex, Basic_edge>]’ at /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:92:65:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _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 = 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:312: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:157:61:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:312: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:168:65:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 55%] Built target withPoints
make  -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/lineGraph /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/lineGraph /<<PKGBUILDDIR>>/build-14/src/lineGraph/CMakeFiles/lineGraph.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 55%] Building C object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull.c.o
cd /<<PKGBUILDDIR>>/build-14/src/lineGraph && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 56%] Building CXX object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraphFull_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/lineGraph && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/src/lineGraph/lineGraphFull_driver.cpp:36:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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++/12/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++/12/bits/stl_tree.h:2457: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++/12/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++/12/bits/stl_tree.h:2457: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++/12/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++/12/bits/stl_tree.h:2457: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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/lineGraph/lineGraphFull_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Line_graph_full_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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 = 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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287: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
 1287 |           _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:520:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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:93:49:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 56%] Building C object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph.c.o
cd /<<PKGBUILDDIR>>/build-14/src/lineGraph && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 56%] Building CXX object src/lineGraph/CMakeFiles/lineGraph.dir/lineGraph_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/lineGraph && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dijkstra/pgr_dijkstra.hpp:40,
                 from /<<PKGBUILDDIR>>/src/lineGraph/lineGraph_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/lineGraph/lineGraph_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Edge_t>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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[](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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         std::tuple<>());
      |                                         ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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:520:26:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:89:48:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 56%] Built target lineGraph
make  -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/components /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/components /<<PKGBUILDDIR>>/build-14/src/components/CMakeFiles/components.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 57%] Building C object src/components/CMakeFiles/components.dir/connectedComponents.c.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/components/connectedComponents.c: In function ‘_pgr_connectedcomponents’:
/<<PKGBUILDDIR>>/src/components/connectedComponents.c:153: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]
  153 |         values[0] = Int64GetDatum(funcctx->call_cntr + 1);
      |                                   ~~~~~~~~~~~~~~~~~~~^~~
[ 57%] Building C object src/components/CMakeFiles/components.dir/strongComponents.c.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/components/strongComponents.c: In function ‘_pgr_strongcomponents’:
/<<PKGBUILDDIR>>/src/components/strongComponents.c:152: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]
  152 |         values[0] = Int64GetDatum(funcctx->call_cntr + 1);
      |                                   ~~~~~~~~~~~~~~~~~~~^~~
[ 58%] Building C object src/components/CMakeFiles/components.dir/biconnectedComponents.c.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/components/biconnectedComponents.c: In function ‘_pgr_biconnectedcomponents’:
/<<PKGBUILDDIR>>/src/components/biconnectedComponents.c:152: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]
  152 |         values[0] = Int64GetDatum(funcctx->call_cntr + 1);
      |                                   ~~~~~~~~~~~~~~~~~~~^~~
[ 58%] Building C object src/components/CMakeFiles/components.dir/articulationPoints.c.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 59%] Building C object src/components/CMakeFiles/components.dir/bridges.c.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 59%] Building C object src/components/CMakeFiles/components.dir/makeConnected.c.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 60%] Building CXX object src/components/CMakeFiles/components.dir/makeConnected_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 60%] Building CXX object src/components/CMakeFiles/components.dir/componentsResult.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/components/componentsResult.cpp:30:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/components/componentsResult.h:31,
                 from /<<PKGBUILDDIR>>/src/components/componentsResult.cpp:27:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_algo.h:4820: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++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820: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++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_vector.h:1294: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++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 61%] Building CXX object src/components/CMakeFiles/components.dir/pgr_components.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /usr/include/boost/graph/adjacency_list.hpp:16,
                 from /<<PKGBUILDDIR>>/include/components/pgr_components.hpp:32,
                 from /<<PKGBUILDDIR>>/src/components/pgr_components.cpp:27:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 61%] Building CXX object src/components/CMakeFiles/components.dir/connectedComponents_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 62%] Building CXX object src/components/CMakeFiles/components.dir/strongComponents_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 62%] Building CXX object src/components/CMakeFiles/components.dir/biconnectedComponents_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 63%] Building CXX object src/components/CMakeFiles/components.dir/articulationPoints_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 63%] Building CXX object src/components/CMakeFiles/components.dir/bridges_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/components && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[ 63%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bellman_ford /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/bellman_ford /<<PKGBUILDDIR>>/build-14/src/bellman_ford/CMakeFiles/bellman_ford.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
[ 63%] Building C object src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford.c.o
cd /<<PKGBUILDDIR>>/build-14/src/bellman_ford && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 64%] Building CXX object src/bellman_ford/CMakeFiles/bellman_ford.dir/bellman_ford_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/bellman_ford && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:35:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:902: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
  902 |     __unique(_ForwardIterator __first, _ForwardIterator __last,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:902: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/bellman_ford/pgr_bellman_ford.hpp:32,
                 from /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:38:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/bellman_ford/bellman_ford_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> 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:200:38:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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 = 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<Path> 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:203:45:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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<Path> 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:200:38:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> 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:203:45:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:62:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:62:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:67:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:67:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:62:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:62:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:67:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:67:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:520: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:949: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:408: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:361: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:130:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:130:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:140:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:140:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 64%] Building C object src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore.c.o
cd /<<PKGBUILDDIR>>/build-14/src/bellman_ford && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 65%] Building CXX object src/bellman_ford/CMakeFiles/bellman_ford.dir/edwardMoore_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/bellman_ford && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:36:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:38:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/bellman_ford/edwardMoore_driver.cpp:35:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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<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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:60:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:60:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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 ‘std::deque<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++/12/bits/stl_vector.h:1287: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
 1287 |           _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<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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:60:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:60:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:65:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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::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:520: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:949: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:408: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:361: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:125:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:125:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:134:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:134:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 65%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/cpp_common /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/cpp_common /<<PKGBUILDDIR>>/build-14/src/cpp_common/CMakeFiles/cpp_common.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
[ 65%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/Dmatrix.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:31:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/cpp_common/Dmatrix.h:33,
                 from /<<PKGBUILDDIR>>/src/cpp_common/Dmatrix.cpp:26:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_vector.h:1287: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
 1287 |           _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++/12/bits/stl_algo.h:4820: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++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820: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++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
[ 66%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/compPaths.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 66%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/rule.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 67%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/bpoint.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 67%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/pgr_messages.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 68%] Building CXX object src/cpp_common/CMakeFiles/cpp_common.dir/combinations.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/cpp_common && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/map:60,
                 from /<<PKGBUILDDIR>>/include/cpp_common/combinations.h:31,
                 from /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:24:
/usr/include/c++/12/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 = 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++/12/bits/stl_tree.h:2209: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
 2209 |     _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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::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++/12/bits/stl_tree.h:2457: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
In file included from /usr/include/c++/12/map:61:
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::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(const II_t_rt*, size_t)’ at /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:43:29:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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::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(int64_t*, size_t, int64_t*, size_t)’ at /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:58:32:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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<Path>&, const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:72:42:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         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<Path>&, const std::vector<pgrouting::trsp::Rule>&)’ at /<<PKGBUILDDIR>>/src/cpp_common/combinations.cpp:96:46:
/usr/include/c++/12/bits/stl_map.h:530: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
  530 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |                                         std::forward_as_tuple(std::move(__k)),
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  532 |                                         std::tuple<>());
      |                                         ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 68%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dagShortestPath /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/dagShortestPath /<<PKGBUILDDIR>>/build-14/src/dagShortestPath/CMakeFiles/dagShortestPath.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build.make src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 68%] Building C object src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath.c.o
cd /<<PKGBUILDDIR>>/build-14/src/dagShortestPath && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 69%] Building CXX object src/dagShortestPath/CMakeFiles/dagShortestPath.dir/dagShortestPath_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/dagShortestPath && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:35:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:902: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
  902 |     __unique(_ForwardIterator __first, _ForwardIterator __last,
      |     ^~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:902: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/dagShortestPath/pgr_dagShortestPath.hpp:33,
                 from /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:37:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/dagShortestPath/dagShortestPath_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<double>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<Path> 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:103:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:53:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:53:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:58:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:58:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<Path> 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:197:38,
    inlined from ‘std::deque<Path> 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:65:10:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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 = 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<Path> 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:45,
    inlined from ‘std::deque<Path> 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:65:10:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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<Path> 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:103:26:
/usr/include/c++/12/bits/stl_vector.h:1032:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<double*, std::vector<double> >’ changed in GCC 7.1
 1032 |           _M_fill_insert(end(), __new_size - size(), __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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:53:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:53:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:58:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:58:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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<Path> 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:24:
/usr/include/c++/12/bits/stl_algo.h:945: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
  945 |       return std::__unique(__first, __last,
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
  946 |                            __gnu_cxx::__ops::__iter_equal_to_iter());
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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<Path> 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:197:38,
    inlined from ‘std::deque<Path> 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:65:10:
/usr/include/c++/12/bits/stl_vector.h:1287: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
 1287 |           _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<Path> 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:45,
    inlined from ‘std::deque<Path> 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:65:10:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:120:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:120:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:129:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:129:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 69%] Built target dagShortestPath
make  -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/chinese /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/chinese /<<PKGBUILDDIR>>/build-14/src/chinese/CMakeFiles/chinese.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 69%] Building C object src/chinese/CMakeFiles/chinese.dir/chinesePostman.c.o
cd /<<PKGBUILDDIR>>/build-14/src/chinese && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 70%] Building CXX object src/chinese/CMakeFiles/chinese.dir/chinesePostman_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/chinese && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/set:60,
                 from /<<PKGBUILDDIR>>/src/chinese/chinesePostman_driver.cpp:35:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/chinese/chinesePostman_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<Edge_t>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<CostFlow_t>::iterator’ changed in GCC 7.1
/usr/include/c++/12/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++/12/bits/vector.tcc:439: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++/12/map:61,
                 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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ changed in GCC 7.1
 1287 |           _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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/max_flow/pgr_minCostMaxFlow.hpp:31,
                 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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Edge_t*, std::vector<Edge_t> >’ changed in GCC 7.1
 1287 |           _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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<CostFlow_t*, std::vector<CostFlow_t> >’ changed in GCC 7.1
 1287 |           _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++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<CostFlow_t*, std::vector<CostFlow_t> >’ changed in GCC 7.1
 1287 |           _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:76:36:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<Path_rt*, std::vector<Path_rt> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 70%] Built target chinese
make  -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/spanningTree /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/spanningTree /<<PKGBUILDDIR>>/build-14/src/spanningTree/CMakeFiles/spanningTree.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 70%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/mst_common.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 71%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/details.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:27:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<long long int> pgrouting::details::clean_vids(std::vector<long long int>)’ at /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:34:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<long long int> pgrouting::details::clean_vids(std::vector<long long int>)’ at /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:34:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         std::__insertion_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/include/spanningTree/details.hpp:29,
                 from /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:25:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294:21,
    inlined from ‘std::vector<MST_rt> pgrouting::details::get_no_edge_graph_result(std::vector<long long int>)’ at /<<PKGBUILDDIR>>/src/spanningTree/details.cpp:50:26:
/usr/include/c++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 71%] Building C object src/spanningTree/CMakeFiles/spanningTree.dir/kruskal.c.o
cd /<<PKGBUILDDIR>>/build-14/src/spanningTree && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/spanningTree/kruskal.c: In function ‘_pgr_kruskal’:
/<<PKGBUILDDIR>>/src/spanningTree/kruskal.c:168: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]
  168 |         values[0] = Int64GetDatum(funcctx->call_cntr + 1);
      |                                   ~~~~~~~~~~~~~~~~~~~^~~
[ 72%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/kruskal_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/spanningTree/kruskal_driver.cpp:33:
/usr/include/c++/12/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++/12/bits/vector.tcc:739:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  739 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/vector.tcc:739: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++/12/bits/vector.tcc:739: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++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294: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:195:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:211:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:195:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:211:35:
/usr/include/c++/12/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++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:312:40:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779: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++/12/bits/stl_vector.h:1294: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:314:43:
/usr/include/c++/12/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:239: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:330:29:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:348:32:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779: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++/12/bits/stl_vector.h:1294: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:350:35:
/usr/include/c++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 72%] Building C object src/spanningTree/CMakeFiles/spanningTree.dir/prim.c.o
cd /<<PKGBUILDDIR>>/build-14/src/spanningTree && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/spanningTree/prim.c: In function ‘_pgr_prim’:
/<<PKGBUILDDIR>>/src/spanningTree/prim.c:173: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]
  173 |         values[0] = Int64GetDatum(funcctx->call_cntr + 1);
      |                                   ~~~~~~~~~~~~~~~~~~~^~~
[ 73%] Building CXX object src/spanningTree/CMakeFiles/spanningTree.dir/prim_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/spanningTree && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/spanningTree/prim_driver.cpp:33:
/usr/include/c++/12/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++/12/bits/vector.tcc:739:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  739 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/vector.tcc:739: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++/12/bits/vector.tcc:739: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++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  523 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294: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:195:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:211:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:195:35:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:211:35:
/usr/include/c++/12/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++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:312:40:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779: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++/12/bits/stl_vector.h:1294: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:314:43:
/usr/include/c++/12/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:239: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:330:29:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _M_fill_insert(end(), __new_size - size(), __x);
      |           ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function ‘void std::vector<_Tp, _Alloc>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:348:32:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779: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++/12/bits/stl_vector.h:1294: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:350:35:
/usr/include/c++/12/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-14'
[ 73%] Built target spanningTree
make  -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mincut /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/mincut /<<PKGBUILDDIR>>/build-14/src/mincut/CMakeFiles/mincut.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 73%] Building C object src/mincut/CMakeFiles/mincut.dir/stoerWagner.c.o
cd /<<PKGBUILDDIR>>/build-14/src/mincut && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 74%] Building CXX object src/mincut/CMakeFiles/mincut.dir/stoerWagner_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/mincut && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/mincut/stoerWagner_driver.cpp:33:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<StoerWagner_t>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/boost/graph/stoer_wagner_min_cut.hpp:18,
                 from /<<PKGBUILDDIR>>/include/mincut/pgr_stoerWagner.hpp:36,
                 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> 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:79: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++/12/vector:64:
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> 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:79:34:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<StoerWagner_t*, std::vector<StoerWagner_t> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 74%] Built target mincut
make  -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/version /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/version /<<PKGBUILDDIR>>/build-14/src/version/CMakeFiles/version.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 75%] Building C object src/version/CMakeFiles/version.dir/version.c.o
cd /<<PKGBUILDDIR>>/build-14/src/version && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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-14'
[ 75%] Built target version
make  -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/topologicalSort /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/topologicalSort /<<PKGBUILDDIR>>/build-14/src/topologicalSort/CMakeFiles/topologicalSort.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 75%] Building C object src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort.c.o
cd /<<PKGBUILDDIR>>/build-14/src/topologicalSort && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 76%] Building CXX object src/topologicalSort/CMakeFiles/topologicalSort.dir/topologicalSort_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/topologicalSort && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/topologicalSort/topologicalSort_driver.cpp:34:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<I_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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> 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:50: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:85:38:
/usr/include/c++/12/bits/stl_vector.h:1287:28: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<I_rt*, std::vector<I_rt> >’ changed in GCC 7.1
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 76%] Built target topologicalSort
make  -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/transitiveClosure /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/transitiveClosure /<<PKGBUILDDIR>>/build-14/src/transitiveClosure/CMakeFiles/transitiveClosure.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 76%] Building C object src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure.c.o
cd /<<PKGBUILDDIR>>/build-14/src/transitiveClosure && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 77%] Building CXX object src/transitiveClosure/CMakeFiles/transitiveClosure.dir/transitiveClosure_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/transitiveClosure && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[ 77%] Built target transitiveClosure
make  -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 77%] Building C object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch.c.o
cd /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 78%] Building CXX object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/breadthFirstSearch_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:33:
/usr/include/c++/12/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++/12/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,
      |     ^~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/vector.tcc:739:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  739 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/vector.tcc:739: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++/12/bits/vector.tcc:739: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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /usr/include/boost/graph/adjacency_list.hpp:18,
                 from /<<PKGBUILDDIR>>/include/cpp_common/pgr_base_graph.hpp:31,
                 from /<<PKGBUILDDIR>>/include/breadthFirstSearch/pgr_breadthFirstSearch.hpp:34,
                 from /<<PKGBUILDDIR>>/src/breadthFirstSearch/breadthFirstSearch_driver.cpp:39:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294: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:62:34:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:97: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:67:22:
/usr/include/c++/12/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++/12/vector:64:
In member function ‘void std::vector<_Tp, _Alloc>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:68:31:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:47:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:47:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         std::__insertion_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_vector.h:1294: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:62:34:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:97: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:67:22:
/usr/include/c++/12/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>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:68:31:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:47:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:47:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         std::__insertion_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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:520: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:949: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:408: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:361: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:94:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:94:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:103:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:103:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
[ 78%] Building C object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch.c.o
cd /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 79%] Building CXX object src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/binaryBreadthFirstSearch_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:36:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:38:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/breadthFirstSearch/binaryBreadthFirstSearch_driver.cpp:35:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_tree.h: In member function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:64:
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<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++/12/bits/stl_vector.h:1287: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
 1287 |           _M_realloc_insert(end(), __x);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 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<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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:52:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:52:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:57:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:57:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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 ‘std::deque<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++/12/bits/stl_vector.h:1287: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
 1287 |           _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<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++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:52:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:52:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:57:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::deque<Path> 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:57:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         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::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:520: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:949: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:408: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:361: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:151:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:151:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:167:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:167:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 79%] Built target breadthFirstSearch
make  -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/traversal /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/traversal /<<PKGBUILDDIR>>/build-14/src/traversal/CMakeFiles/traversal.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 79%] Building C object src/traversal/CMakeFiles/traversal.dir/depthFirstSearch.c.o
cd /<<PKGBUILDDIR>>/build-14/src/traversal && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/traversal/depthFirstSearch.c: In function ‘_pgr_depthfirstsearch’:
/<<PKGBUILDDIR>>/src/traversal/depthFirstSearch.c:219: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]
  219 |         values[0] = Int64GetDatum(funcctx->call_cntr + 1);
      |                                   ~~~~~~~~~~~~~~~~~~~^~~
[ 80%] Building CXX object src/traversal/CMakeFiles/traversal.dir/depthFirstSearch_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/traversal && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:32:
/usr/include/c++/12/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++/12/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,
      |     ^~~~~~~~~~~~~
In file included from /usr/include/c++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:31:
/usr/include/c++/12/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++/12/bits/vector.tcc:739:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  739 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/vector.tcc:739: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++/12/bits/vector.tcc:739: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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           std::__introsort_loop(__cut, __last, __depth_limit, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/set:60,
                 from /<<PKGBUILDDIR>>/include/visitors/dfs_visitor.hpp:35,
                 from /<<PKGBUILDDIR>>/include/traversal/pgr_depthFirstSearch.hpp:29,
                 from /<<PKGBUILDDIR>>/src/traversal/depthFirstSearch_driver.cpp:38:
/usr/include/c++/12/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++/12/bits/stl_tree.h:2457: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
 2457 |       _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/vector.tcc:523:5: note: parameter passing for argument of type ‘std::vector<long long int>::iterator’ changed in GCC 7.1
  523 |     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++/12/bits/stl_vector.h:1294: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:90:31:
/usr/include/c++/12/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++/12/vector:64:
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:95:48:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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++/12/bits/stl_vector.h:1294: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:97:23:
/usr/include/c++/12/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>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:98:32:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:78:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:78:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         std::__insertion_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
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++/12/bits/stl_vector.h:1294: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:90:31:
/usr/include/c++/12/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:95:48:
/usr/include/c++/12/bits/stl_vector.h:1032: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
 1032 |           _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++/12/bits/stl_vector.h:1294: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:97:23:
/usr/include/c++/12/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>::_M_insert_dispatch(iterator, _InputIterator, _InputIterator, std::__false_type) [with _InputIterator = __gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >; _Tp = MST_rt; _Alloc = std::allocator<MST_rt>]’,
    inlined from ‘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>]’ at /usr/include/c++/12/bits/stl_vector.h:1481:22,
    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:98:32:
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘std::vector<MST_rt>::iterator’ changed in GCC 7.1
 1779 |           _M_range_insert(__pos, __first, __last,
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
 1780 |                           std::__iterator_category(__first));
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_vector.h:1779:26: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator<MST_rt*, std::vector<MST_rt> >’ changed in GCC 7.1
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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:78:14:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4820:18,
    inlined from ‘std::vector<MST_rt> 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:78:14:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         std::__insertion_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12/map:61,
                 from /<<PKGBUILDDIR>>/include/visitors/dfs_visitor.hpp:36:
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:520: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:949: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:408: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:361: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:152:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:152:33:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:949: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:408: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:361: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:161:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             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:520: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:950: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:408: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:361: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:161:35:
/usr/include/c++/12/bits/stl_map.h:511: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
  511 |           __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  512 |                                             std::tuple<const key_type&>(__k),
      |                                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  513 |                                             std::tuple<>());
      |                                             ~~~~~~~~~~~~~~~
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 80%] Built target traversal
make  -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/coloring /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/coloring /<<PKGBUILDDIR>>/build-14/src/coloring/CMakeFiles/coloring.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 80%] Building C object src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring.c.o
cd /<<PKGBUILDDIR>>/build-14/src/coloring && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 81%] Building CXX object src/coloring/CMakeFiles/coloring.dir/sequentialVertexColoring_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/bits/stl_algo.h:60,
                 from /usr/include/c++/12/algorithm:61,
                 from /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:33:
/usr/include/c++/12/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++/12/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++/12/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++/12/bits/stl_algo.h:1802: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
 1802 |     __insertion_sort(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1802: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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/coloring/sequentialVertexColoring_driver.cpp:32:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/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++/12/bits/stl_algo.h:1908: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
 1908 |     __introsort_loop(_RandomAccessIterator __first,
      |     ^~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1908: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++/12/bits/stl_algo.h:1922: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
 1922 |           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++/12/bits/stl_vector.h:1294: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:135: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:108:18,
    inlined from ‘std::vector<II_t_rt> 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:64: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:120:47:
/usr/include/c++/12/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++/12/bits/stl_algo.h:4853: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:139: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:108:18,
    inlined from ‘std::vector<II_t_rt> 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:64: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:120:47:
/usr/include/c++/12/bits/stl_algo.h:1937: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
 1937 |           std::__introsort_loop(__first, __last,
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
 1938 |                                 std::__lg(__last - __first) * 2,
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1939 |                                 __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++/12/bits/stl_algo.h:1940: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++/12/bits/stl_algo.h:4853: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:139: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:108:18,
    inlined from ‘std::vector<II_t_rt> 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:64: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:120:47:
/usr/include/c++/12/bits/stl_algo.h:1849: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
 1849 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12/bits/stl_algo.h:1854: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
 1854 |         std::__insertion_sort(__first, __last, __comp);
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
[ 81%] Building C object src/coloring/CMakeFiles/coloring.dir/bipartite.c.o
cd /<<PKGBUILDDIR>>/build-14/src/coloring && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 82%] Building CXX object src/coloring/CMakeFiles/coloring.dir/bipartite_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/coloring/bipartite_driver.cpp:38:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294: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:80:45:
/usr/include/c++/12/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++/12/bits/stl_vector.h:1294: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:80:45:
/usr/include/c++/12/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)...);
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[ 82%] Building C object src/coloring/CMakeFiles/coloring.dir/edgeColoring.c.o
cd /<<PKGBUILDDIR>>/build-14/src/coloring && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 83%] Building CXX object src/coloring/CMakeFiles/coloring.dir/edgeColoring_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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
[ 83%] Building CXX object src/coloring/CMakeFiles/coloring.dir/pgr_edgeColoring.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/coloring && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /usr/include/boost/graph/adjacency_list.hpp:16,
                 from /<<PKGBUILDDIR>>/include/coloring/pgr_edgeColoring.hpp:31,
                 from /<<PKGBUILDDIR>>/src/coloring/pgr_edgeColoring.cpp:29:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294:21,
    inlined from ‘std::vector<II_t_rt> pgrouting::functions::Pgr_edgeColoring::edgeColoring()’ at /<<PKGBUILDDIR>>/src/coloring/pgr_edgeColoring.cpp:62:26:
/usr/include/c++/12/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-14'
[ 83%] Built target coloring
make  -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/planar /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/planar /<<PKGBUILDDIR>>/build-14/src/planar/CMakeFiles/planar.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 83%] Building C object src/planar/CMakeFiles/planar.dir/isPlanar.c.o
cd /<<PKGBUILDDIR>>/build-14/src/planar && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 84%] Building CXX object src/planar/CMakeFiles/planar.dir/isPlanar_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/planar && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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-14'
[ 84%] Built target planar
make  -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dominator /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/dominator /<<PKGBUILDDIR>>/build-14/src/dominator/CMakeFiles/dominator.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 84%] Building C object src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree.c.o
cd /<<PKGBUILDDIR>>/build-14/src/dominator && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
[ 85%] Building CXX object src/dominator/CMakeFiles/dominator.dir/lengauerTarjanDominatorTree_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/dominator && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/dominator/lengauerTarjanDominatorTree_driver.cpp:36:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
  439 |       vector<_Tp, _Alloc>::
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /<<PKGBUILDDIR>>/include/dominator/pgr_lengauerTarjanDominatorTree_driver.hpp:37,
                 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++/12/bits/stl_vector.h:1294: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:85: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:82:41:
/usr/include/c++/12/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-14'
[ 85%] Built target dominator
make  -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ordering /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/ordering /<<PKGBUILDDIR>>/build-14/src/ordering/CMakeFiles/ordering.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 85%] Building C object src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering.c.o
cd /<<PKGBUILDDIR>>/build-14/src/ordering && /usr/bin/cc -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-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
/<<PKGBUILDDIR>>/src/ordering/cuthillMckeeOrdering.c: In function ‘_pgr_cuthillmckeeordering’:
/<<PKGBUILDDIR>>/src/ordering/cuthillMckeeOrdering.c:192: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]
  192 |         values[0] = Int64GetDatum(funcctx->call_cntr + 1);
      |                                   ~~~~~~~~~~~~~~~~~~~^~~
[ 86%] Building CXX object src/ordering/CMakeFiles/ordering.dir/cuthillMckeeOrdering_driver.cpp.o
cd /<<PKGBUILDDIR>>/build-14/src/ordering && /usr/bin/c++ -DBOOST_ALLOW_DEPRECATED_HEADERS -DBoost_VERSION_MACRO=107400 -DPGSQL_VERSION=145 -DPROJECT_VERSION=\"3.4.1\" -I/<<PKGBUILDDIR>>/include -isystem /usr/include/postgresql/14/server -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC  -frounding-math  -O3 -DNDEBUG   -Wsign-conversion -Wfloat-conversion -std=c++11 -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++/12/vector:70,
                 from /<<PKGBUILDDIR>>/src/ordering/cuthillMckeeOrdering_driver.cpp:30:
/usr/include/c++/12/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++/12/bits/vector.tcc:439:7: note: parameter passing for argument of type ‘std::vector<II_t_rt>::iterator’ changed in GCC 7.1
  439 |       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++/12/bits/stl_vector.h:1294: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:149: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:123:18:
/usr/include/c++/12/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-14'
[ 86%] Built target ordering
make  -f CMakeFiles/pgrouting-3.4.dir/build.make CMakeFiles/pgrouting-3.4.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/CMakeFiles/pgrouting-3.4.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f CMakeFiles/pgrouting-3.4.dir/build.make CMakeFiles/pgrouting-3.4.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 86%] Linking CXX shared library lib/libpgrouting-3.4.so
/usr/bin/cmake -E cmake_link_script CMakeFiles/pgrouting-3.4.dir/link.txt --verbose=1
/usr/bin/c++ -fPIC -g -O2 -ffile-prefix-map=/<<PKGBUILDDIR>>=. -fstack-protector-strong -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.4.so -o lib/libpgrouting-3.4.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/points_input.c.o src/common/CMakeFiles/common.dir/matrixRows_input.c.o src/common/CMakeFiles/common.dir/get_check_data.c.o src/common/CMakeFiles/common.dir/edges_input.c.o src/common/CMakeFiles/common.dir/combinations_input.c.o src/common/CMakeFiles/common.dir/orders_input.c.o src/common/CMakeFiles/common.dir/vehicles_input.c.o src/common/CMakeFiles/common.dir/restrictions_input.c.o src/common/CMakeFiles/common.dir/coordinates_input.c.o src/common/CMakeFiles/common.dir/arrays_input.c.o src/common/CMakeFiles/common.dir/delauny_input.c.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/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-14'
[ 86%] Built target pgrouting-3.4
make  -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/sql /<<PKGBUILDDIR>>/build-14/sql/CMakeFiles/extension_file.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 86%] Generating pgrouting--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-file.pl '/<<PKGBUILDDIR>>/build-14/sql/common/pgRouting-header.sql /<<PKGBUILDDIR>>/build-14/sql/common/_point_toId.sql /<<PKGBUILDDIR>>/build-14/sql/common/_startPoint.sql /<<PKGBUILDDIR>>/build-14/sql/common/_endPoint.sql /<<PKGBUILDDIR>>/build-14/sql/common/pgrouting_utilities.sql /<<PKGBUILDDIR>>/build-14/sql/common/pgr_parameter_check.sql /<<PKGBUILDDIR>>/build-14/sql/common/utilities_pgr.sql /<<PKGBUILDDIR>>/build-14/sql/common/createIndex.sql /<<PKGBUILDDIR>>/build-14/sql/common/_checkquery.sql /<<PKGBUILDDIR>>/build-14/sql/common/_checkcolumn.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/_dijkstra.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/dijkstra.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/dijkstraCost.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/dijkstraCostMatrix.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/_dijkstraVia.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/dijkstraVia.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/_dijkstraNear.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/dijkstraNear.sql /<<PKGBUILDDIR>>/build-14/sql/dijkstra/dijkstraNearCost.sql /<<PKGBUILDDIR>>/build-14/sql/allpairs/_johnson.sql /<<PKGBUILDDIR>>/build-14/sql/allpairs/johnson.sql /<<PKGBUILDDIR>>/build-14/sql/allpairs/_floydWarshall.sql /<<PKGBUILDDIR>>/build-14/sql/allpairs/floydWarshall.sql /<<PKGBUILDDIR>>/build-14/sql/astar/_astar.sql /<<PKGBUILDDIR>>/build-14/sql/astar/astar.sql /<<PKGBUILDDIR>>/build-14/sql/astar/astarCost.sql /<<PKGBUILDDIR>>/build-14/sql/astar/astarCostMatrix.sql /<<PKGBUILDDIR>>/build-14/sql/driving_distance/_withPointsDD.sql /<<PKGBUILDDIR>>/build-14/sql/driving_distance/withPointsDD.sql /<<PKGBUILDDIR>>/build-14/sql/driving_distance/_drivingDistance.sql /<<PKGBUILDDIR>>/build-14/sql/driving_distance/drivingDistance.sql /<<PKGBUILDDIR>>/build-14/sql/ksp/_ksp.sql /<<PKGBUILDDIR>>/build-14/sql/ksp/ksp.sql /<<PKGBUILDDIR>>/build-14/sql/ksp/_withPointsKSP.sql /<<PKGBUILDDIR>>/build-14/sql/ksp/withPointsKSP.sql /<<PKGBUILDDIR>>/build-14/sql/ksp/_turnRestrictedPath.sql /<<PKGBUILDDIR>>/build-14/sql/ksp/turnRestrictedPath.sql /<<PKGBUILDDIR>>/build-14/sql/tsp/_TSP.sql /<<PKGBUILDDIR>>/build-14/sql/tsp/_TSPeuclidean.sql /<<PKGBUILDDIR>>/build-14/sql/tsp/TSP.sql /<<PKGBUILDDIR>>/build-14/sql/tsp/TSPeuclidean.sql /<<PKGBUILDDIR>>/build-14/sql/alpha_shape/_alphaShape.sql /<<PKGBUILDDIR>>/build-14/sql/alpha_shape/alphaShape.sql /<<PKGBUILDDIR>>/build-14/sql/bdAstar/_bdAstar.sql /<<PKGBUILDDIR>>/build-14/sql/bdAstar/bdAstar.sql /<<PKGBUILDDIR>>/build-14/sql/bdAstar/bdAstarCost.sql /<<PKGBUILDDIR>>/build-14/sql/bdAstar/bdAstarCostMatrix.sql /<<PKGBUILDDIR>>/build-14/sql/bdDijkstra/_bdDijkstra.sql /<<PKGBUILDDIR>>/build-14/sql/bdDijkstra/bdDijkstra.sql /<<PKGBUILDDIR>>/build-14/sql/bdDijkstra/bdDijkstraCost.sql /<<PKGBUILDDIR>>/build-14/sql/bdDijkstra/bdDijkstraCostMatrix.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/_trsp.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/trsp.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/_pgr_trsp.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/_array_reverse.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/pgr_trsp.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/_pgr_trspViaVertices.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/pgr_trspViaVertices.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/pgr_trspViaEdges.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/_trsp_withPoints.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/trsp_withPoints.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/trspVia.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/_trspVia.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/trspVia_withPoints.sql /<<PKGBUILDDIR>>/build-14/sql/trsp/_trspVia_withPoints.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/_maxflow.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/_maxFlowMinCost.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/edmondsKarp.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/boykovKolmogorov.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/pushRelabel.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/_maxCardinalityMatch.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/maxCardinalityMatch.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/_edgeDisjointPaths.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/edgeDisjointPaths.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/maxFlowMinCost.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/maxFlowMinCost_Cost.sql /<<PKGBUILDDIR>>/build-14/sql/max_flow/maxFlow.sql /<<PKGBUILDDIR>>/build-14/sql/contraction/_contraction.sql /<<PKGBUILDDIR>>/build-14/sql/contraction/contraction.sql /<<PKGBUILDDIR>>/build-14/sql/pickDeliver/_pickDeliver.sql /<<PKGBUILDDIR>>/build-14/sql/pickDeliver/pickDeliver.sql /<<PKGBUILDDIR>>/build-14/sql/pickDeliver/_pickDeliverEuclidean.sql /<<PKGBUILDDIR>>/build-14/sql/pickDeliver/pickDeliverEuclidean.sql /<<PKGBUILDDIR>>/build-14/sql/vrp_basic/_pgr_vrpOneDepot.sql /<<PKGBUILDDIR>>/build-14/sql/vrp_basic/pgr_vrpOneDepot.sql /<<PKGBUILDDIR>>/build-14/sql/withPoints/_withPoints.sql /<<PKGBUILDDIR>>/build-14/sql/withPoints/withPoints.sql /<<PKGBUILDDIR>>/build-14/sql/withPoints/withPointsCost.sql /<<PKGBUILDDIR>>/build-14/sql/withPoints/withPointsCostMatrix.sql /<<PKGBUILDDIR>>/build-14/sql/withPoints/_withPointsVia.sql /<<PKGBUILDDIR>>/build-14/sql/withPoints/withPointsVia.sql /<<PKGBUILDDIR>>/build-14/sql/lineGraph/_lineGraphFull.sql /<<PKGBUILDDIR>>/build-14/sql/lineGraph/lineGraphFull.sql /<<PKGBUILDDIR>>/build-14/sql/lineGraph/_lineGraph.sql /<<PKGBUILDDIR>>/build-14/sql/lineGraph/lineGraph.sql /<<PKGBUILDDIR>>/build-14/sql/components/_connectedComponents.sql /<<PKGBUILDDIR>>/build-14/sql/components/connectedComponents.sql /<<PKGBUILDDIR>>/build-14/sql/components/_strongComponents.sql /<<PKGBUILDDIR>>/build-14/sql/components/strongComponents.sql /<<PKGBUILDDIR>>/build-14/sql/components/_biconnectedComponents.sql /<<PKGBUILDDIR>>/build-14/sql/components/biconnectedComponents.sql /<<PKGBUILDDIR>>/build-14/sql/components/_articulationPoints.sql /<<PKGBUILDDIR>>/build-14/sql/components/articulationPoints.sql /<<PKGBUILDDIR>>/build-14/sql/components/_bridges.sql /<<PKGBUILDDIR>>/build-14/sql/components/bridges.sql /<<PKGBUILDDIR>>/build-14/sql/components/_makeConnected.sql /<<PKGBUILDDIR>>/build-14/sql/components/makeConnected.sql /<<PKGBUILDDIR>>/build-14/sql/bellman_ford/_bellman_ford.sql /<<PKGBUILDDIR>>/build-14/sql/bellman_ford/bellman_ford.sql /<<PKGBUILDDIR>>/build-14/sql/bellman_ford/_edwardMoore.sql /<<PKGBUILDDIR>>/build-14/sql/bellman_ford/edwardMoore.sql /<<PKGBUILDDIR>>/build-14/sql/dagShortestPath/_dagShortestPath.sql /<<PKGBUILDDIR>>/build-14/sql/dagShortestPath/dagShortestPath.sql /<<PKGBUILDDIR>>/build-14/sql/chinese/_pgr_chinesePostman.sql /<<PKGBUILDDIR>>/build-14/sql/chinese/pgr_chinesePostman.sql /<<PKGBUILDDIR>>/build-14/sql/chinese/pgr_chinesePostmanCost.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/_prim.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/_kruskal.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/prim.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/primDFS.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/primBFS.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/primDD.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/kruskal.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/kruskalDFS.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/kruskalBFS.sql /<<PKGBUILDDIR>>/build-14/sql/spanningTree/kruskalDD.sql /<<PKGBUILDDIR>>/build-14/sql/mincut/_stoerWagner.sql /<<PKGBUILDDIR>>/build-14/sql/mincut/stoerWagner.sql /<<PKGBUILDDIR>>/build-14/sql/version/_version.sql /<<PKGBUILDDIR>>/build-14/sql/version/version.sql /<<PKGBUILDDIR>>/build-14/sql/version/full_version.sql /<<PKGBUILDDIR>>/build-14/sql/topologicalSort/_topologicalSort.sql /<<PKGBUILDDIR>>/build-14/sql/topologicalSort/topologicalSort.sql /<<PKGBUILDDIR>>/build-14/sql/transitiveClosure/_transitiveClosure.sql /<<PKGBUILDDIR>>/build-14/sql/transitiveClosure/transitiveClosure.sql /<<PKGBUILDDIR>>/build-14/sql/breadthFirstSearch/_breadthFirstSearch.sql /<<PKGBUILDDIR>>/build-14/sql/breadthFirstSearch/_binaryBreadthFirstSearch.sql /<<PKGBUILDDIR>>/build-14/sql/breadthFirstSearch/breadthFirstSearch.sql /<<PKGBUILDDIR>>/build-14/sql/breadthFirstSearch/binaryBreadthFirstSearch.sql /<<PKGBUILDDIR>>/build-14/sql/traversal/_depthFirstSearch.sql /<<PKGBUILDDIR>>/build-14/sql/traversal/depthFirstSearch.sql /<<PKGBUILDDIR>>/build-14/sql/coloring/_sequentialVertexColoring.sql /<<PKGBUILDDIR>>/build-14/sql/coloring/sequentialVertexColoring.sql /<<PKGBUILDDIR>>/build-14/sql/coloring/_bipartite.sql /<<PKGBUILDDIR>>/build-14/sql/coloring/bipartite.sql /<<PKGBUILDDIR>>/build-14/sql/coloring/_edgeColoring.sql /<<PKGBUILDDIR>>/build-14/sql/coloring/edgeColoring.sql /<<PKGBUILDDIR>>/build-14/sql/planar/_isPlanar.sql /<<PKGBUILDDIR>>/build-14/sql/planar/isPlanar.sql /<<PKGBUILDDIR>>/build-14/sql/dominator/_lengauerTarjanDominatorTree.sql /<<PKGBUILDDIR>>/build-14/sql/dominator/lengauerTarjanDominatorTree.sql /<<PKGBUILDDIR>>/build-14/sql/ordering/_cuthillMckeeOrdering.sql /<<PKGBUILDDIR>>/build-14/sql/ordering/cuthillMckeeOrdering.sql /<<PKGBUILDDIR>>/build-14/sql/circuits/_hawickCircuits.sql /<<PKGBUILDDIR>>/build-14/sql/circuits/hawickCircuits.sql /<<PKGBUILDDIR>>/build-14/sql/topology/createtopology.sql /<<PKGBUILDDIR>>/build-14/sql/topology/analyzegraph.sql /<<PKGBUILDDIR>>/build-14/sql/topology/analyzeOneway.sql /<<PKGBUILDDIR>>/build-14/sql/topology/createverticestable.sql /<<PKGBUILDDIR>>/build-14/sql/topology/nodeNetwork.sql /<<PKGBUILDDIR>>/build-14/sql/topology/extractVertices.sql /<<PKGBUILDDIR>>/build-14/sql/topology/degree.sql /<<PKGBUILDDIR>>/build-14/sql/utilities/findCloseEdges.sql'
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 86%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/sql /<<PKGBUILDDIR>>/build-14/sql/CMakeFiles/update_files.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f sql/CMakeFiles/update_files.dir/build.make sql/CMakeFiles/update_files.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[ 87%] Generating pgrouting--3.4.0--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.4.0 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 87%] Generating pgrouting--3.3.5--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.3.5 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 88%] Generating pgrouting--3.3.4--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.3.4 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 88%] Generating pgrouting--3.3.3--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.3.3 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 89%] Generating pgrouting--3.3.2--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.3.2 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 89%] Generating pgrouting--3.3.1--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.3.1 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 90%] Generating pgrouting--3.3.0--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.3.0 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 90%] Generating pgrouting--3.2.2--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.2.2 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 91%] Generating pgrouting--3.2.1--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.2.1 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 91%] Generating pgrouting--3.2.0--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.2.0 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 92%] Generating pgrouting--3.1.4--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.1.4 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 92%] Generating pgrouting--3.1.3--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.1.3 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 93%] Generating pgrouting--3.1.2--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.1.2 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 93%] Generating pgrouting--3.1.1--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.1.1 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 94%] Generating pgrouting--3.1.0--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.1.0 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 94%] Generating pgrouting--3.0.6--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.0.6 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 95%] Generating pgrouting--3.0.5--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.0.5 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 95%] Generating pgrouting--3.0.4--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.0.4 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 96%] Generating pgrouting--3.0.3--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.0.3 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 96%] Generating pgrouting--3.0.2--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.0.2 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 97%] Generating pgrouting--3.0.1--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.0.1 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 97%] Generating pgrouting--3.0.0--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 3.0.0 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 98%] Generating pgrouting--2.6.3--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 2.6.3 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[ 98%] Generating pgrouting--2.6.2--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 2.6.2 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[100%] Generating pgrouting--2.6.1--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 2.6.1 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
[100%] Generating pgrouting--2.6.0--3.4.1.sql
cd /<<PKGBUILDDIR>>/build-14/sql && /usr/bin/perl ./scripts/build-extension-update-files.pl 3.4.1 2.6.0 /<<PKGBUILDDIR>>/build-14/sql/sigs /<<PKGBUILDDIR>>/build-14/sql 
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[100%] Built target update_files
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-14/CMakeFiles 0
make[2]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
### End 14 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-14'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-14 --check-build-system CMakeFiles/Makefile.cmake 0
make  -f CMakeFiles/Makefile2 doc
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-14'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-14 --check-build-system CMakeFiles/Makefile.cmake 0
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-14/CMakeFiles 1
make  -f CMakeFiles/Makefile2 doc/CMakeFiles/doc.dir/all
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make  -f doc/CMakeFiles/html-en.dir/build.make doc/CMakeFiles/html-en.dir/depend
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/doc /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/doc /<<PKGBUILDDIR>>/build-14/doc/CMakeFiles/html-en.dir/DependInfo.cmake --color=
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f doc/CMakeFiles/html-en.dir/build.make doc/CMakeFiles/html-en.dir/build
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-14'
[100%] Generating html/en documentation ...
cd /<<PKGBUILDDIR>>/build-14/doc && /usr/bin/sphinx-build -v -W --keep-going -b html -D language='en' -c /<<PKGBUILDDIR>>/build-14/doc /<<PKGBUILDDIR>>/build-14/doc /<<PKGBUILDDIR>>/build-14/doc/html/en
Running Sphinx v4.5.0
loading translations [en]... done
making output directory... done
building [mo]: targets for 2 po files that are out of date
writing output... [ 50%] ../../locale/en/LC_MESSAGES/pgrouting_doc_strings.mo
writing output... [100%] ../../locale/en/LC_MESSAGES/index.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... [  0%] BFS-category
reading sources... [  1%] DFS-category
reading sources... [  2%] KSP-category
reading sources... [  3%] TRSP-family
reading sources... [  3%] TSP-family
reading sources... [  4%] VRP-category
reading sources... [  5%] aStar-family
reading sources... [  6%] allpairs-family
reading sources... [  6%] bdAstar-family
reading sources... [  7%] bdDijkstra-family
reading sources... [  8%] chinesePostmanProblem-family
reading sources... [  9%] coloring-family
reading sources... [ 10%] components-family
reading sources... [ 10%] contraction-family
reading sources... [ 11%] cost-category
reading sources... [ 12%] costMatrix-category
reading sources... [ 13%] dijkstra-family
reading sources... [ 13%] drivingDistance-category
reading sources... [ 14%] experimental
reading sources... [ 15%] flow-family
reading sources... [ 16%] index
reading sources... [ 16%] kruskal-family
reading sources... [ 17%] migration
reading sources... [ 18%] ordering-family
reading sources... [ 19%] pgRouting-concepts
reading sources... [ 20%] pgRouting-installation
reading sources... [ 20%] pgRouting-introduction
reading sources... [ 21%] pgr_KSP
reading sources... [ 22%] pgr_TSP
reading sources... [ 23%] pgr_TSPeuclidean
reading sources... [ 23%] pgr_aStar
reading sources... [ 24%] pgr_aStarCost
reading sources... [ 25%] pgr_aStarCostMatrix
reading sources... [ 26%] pgr_alphaShape
reading sources... [ 26%] pgr_analyzeGraph
reading sources... [ 27%] pgr_analyzeOneWay
reading sources... [ 28%] pgr_articulationPoints
reading sources... [ 29%] pgr_bdAstar
reading sources... [ 30%] pgr_bdAstarCost
reading sources... [ 30%] pgr_bdAstarCostMatrix
reading sources... [ 31%] pgr_bdDijkstra
reading sources... [ 32%] pgr_bdDijkstraCost
reading sources... [ 33%] pgr_bdDijkstraCostMatrix
reading sources... [ 33%] pgr_bellmanFord
reading sources... [ 34%] pgr_biconnectedComponents
reading sources... [ 35%] pgr_binaryBreadthFirstSearch
reading sources... [ 36%] pgr_bipartite
reading sources... [ 36%] pgr_boykovKolmogorov
reading sources... [ 37%] pgr_breadthFirstSearch
reading sources... [ 38%] pgr_bridges
reading sources... [ 39%] pgr_chinesePostman
reading sources... [ 40%] pgr_chinesePostmanCost
reading sources... [ 40%] pgr_connectedComponents
reading sources... [ 41%] pgr_contraction
reading sources... [ 42%] pgr_createTopology
reading sources... [ 43%] pgr_createVerticesTable
reading sources... [ 43%] pgr_cuthillMckeeOrdering
reading sources... [ 44%] pgr_dagShortestPath
reading sources... [ 45%] pgr_degree
reading sources... [ 46%] pgr_depthFirstSearch
reading sources... [ 46%] pgr_dijkstra
reading sources... [ 47%] pgr_dijkstraCost
reading sources... [ 48%] pgr_dijkstraCostMatrix
reading sources... [ 49%] pgr_dijkstraNear
reading sources... [ 50%] pgr_dijkstraNearCost
reading sources... [ 50%] pgr_dijkstraVia
reading sources... [ 51%] pgr_drivingDistance
reading sources... [ 52%] pgr_edgeColoring
reading sources... [ 53%] pgr_edgeDisjointPaths
reading sources... [ 53%] pgr_edmondsKarp
reading sources... [ 54%] pgr_edwardMoore
reading sources... [ 55%] pgr_extractVertices
reading sources... [ 56%] pgr_findCloseEdges
reading sources... [ 56%] pgr_floydWarshall
reading sources... [ 57%] pgr_full_version
reading sources... [ 58%] pgr_hawickCircuits
reading sources... [ 59%] pgr_isPlanar
reading sources... [ 60%] pgr_johnson
reading sources... [ 60%] pgr_kruskal
reading sources... [ 61%] pgr_kruskalBFS
reading sources... [ 62%] pgr_kruskalDD
reading sources... [ 63%] pgr_kruskalDFS
reading sources... [ 63%] pgr_lengauerTarjanDominatorTree
reading sources... [ 64%] pgr_lineGraph
reading sources... [ 65%] pgr_lineGraphFull
reading sources... [ 66%] pgr_makeConnected
reading sources... [ 66%] pgr_maxCardinalityMatch
reading sources... [ 67%] pgr_maxFlow
reading sources... [ 68%] pgr_maxFlowMinCost
reading sources... [ 69%] pgr_maxFlowMinCost_Cost
reading sources... [ 70%] pgr_nodeNetwork
reading sources... [ 70%] pgr_pickDeliver
reading sources... [ 71%] pgr_pickDeliverEuclidean
reading sources... [ 72%] pgr_prim
reading sources... [ 73%] pgr_primBFS
reading sources... [ 73%] pgr_primDD
reading sources... [ 74%] pgr_primDFS
reading sources... [ 75%] pgr_pushRelabel
reading sources... [ 76%] pgr_sequentialVertexColoring
reading sources... [ 76%] pgr_stoerWagner
reading sources... [ 77%] pgr_strongComponents
reading sources... [ 78%] pgr_topologicalSort
reading sources... [ 79%] pgr_transitiveClosure
reading sources... [ 80%] pgr_trsp
reading sources... [ 80%] pgr_trspVia
reading sources... [ 81%] pgr_trspVia_withPoints
reading sources... [ 82%] pgr_trsp_withPoints
reading sources... [ 83%] pgr_turnRestrictedPath
reading sources... [ 83%] pgr_version
reading sources... [ 84%] pgr_vrpOneDepot
reading sources... [ 85%] pgr_withPoints
reading sources... [ 86%] pgr_withPointsCost
reading sources... [ 86%] pgr_withPointsCostMatrix
reading sources... [ 87%] pgr_withPointsDD
reading sources... [ 88%] pgr_withPointsKSP
reading sources... [ 89%] pgr_withPointsVia
reading sources... [ 90%] prim-family
reading sources... [ 90%] proposed
reading sources... [ 91%] reference
reading sources... [ 92%] release_notes
reading sources... [ 93%] routingFunctions
reading sources... [ 93%] sampledata
reading sources... [ 94%] spanningTree-family
reading sources... [ 95%] support
reading sources... [ 96%] topology-functions
reading sources... [ 96%] transformation-family
reading sources... [ 97%] traversal-family
reading sources... [ 98%] via-category
reading sources... [ 99%] withPoints-category
reading sources... [100%] withPoints-family

looking for now-outdated files... none found
pickling environment... done
checking consistency... done
preparing documents... done
writing output... [  0%] BFS-category
writing output... [  1%] DFS-category
writing output... [  2%] KSP-category
writing output... [  3%] TRSP-family
writing output... [  3%] TSP-family
writing output... [  4%] VRP-category
writing output... [  5%] aStar-family
writing output... [  6%] allpairs-family
writing output... [  6%] bdAstar-family
writing output... [  7%] bdDijkstra-family
writing output... [  8%] chinesePostmanProblem-family
writing output... [  9%] coloring-family
writing output... [ 10%] components-family
writing output... [ 10%] contraction-family
writing output... [ 11%] cost-category
writing output... [ 12%] costMatrix-category
writing output... [ 13%] dijkstra-family
writing output... [ 13%] drivingDistance-category
writing output... [ 14%] experimental
writing output... [ 15%] flow-family
writing output... [ 16%] index
writing output... [ 16%] kruskal-family
writing output... [ 17%] migration
writing output... [ 18%] ordering-family
writing output... [ 19%] pgRouting-concepts
writing output... [ 20%] pgRouting-installation
writing output... [ 20%] pgRouting-introduction
writing output... [ 21%] pgr_KSP
writing output... [ 22%] pgr_TSP
writing output... [ 23%] pgr_TSPeuclidean
writing output... [ 23%] pgr_aStar
writing output... [ 24%] pgr_aStarCost
writing output... [ 25%] pgr_aStarCostMatrix
writing output... [ 26%] pgr_alphaShape
writing output... [ 26%] pgr_analyzeGraph
writing output... [ 27%] pgr_analyzeOneWay
writing output... [ 28%] pgr_articulationPoints
writing output... [ 29%] pgr_bdAstar
writing output... [ 30%] pgr_bdAstarCost
writing output... [ 30%] pgr_bdAstarCostMatrix
writing output... [ 31%] pgr_bdDijkstra
writing output... [ 32%] pgr_bdDijkstraCost
writing output... [ 33%] pgr_bdDijkstraCostMatrix
writing output... [ 33%] pgr_bellmanFord
writing output... [ 34%] pgr_biconnectedComponents
writing output... [ 35%] pgr_binaryBreadthFirstSearch
writing output... [ 36%] pgr_bipartite
writing output... [ 36%] pgr_boykovKolmogorov
writing output... [ 37%] pgr_breadthFirstSearch
writing output... [ 38%] pgr_bridges
writing output... [ 39%] pgr_chinesePostman
writing output... [ 40%] pgr_chinesePostmanCost
writing output... [ 40%] pgr_connectedComponents
writing output... [ 41%] pgr_contraction
writing output... [ 42%] pgr_createTopology
writing output... [ 43%] pgr_createVerticesTable
writing output... [ 43%] pgr_cuthillMckeeOrdering
writing output... [ 44%] pgr_dagShortestPath
writing output... [ 45%] pgr_degree
writing output... [ 46%] pgr_depthFirstSearch
writing output... [ 46%] pgr_dijkstra
writing output... [ 47%] pgr_dijkstraCost
writing output... [ 48%] pgr_dijkstraCostMatrix
writing output... [ 49%] pgr_dijkstraNear
writing output... [ 50%] pgr_dijkstraNearCost
writing output... [ 50%] pgr_dijkstraVia
writing output... [ 51%] pgr_drivingDistance
writing output... [ 52%] pgr_edgeColoring
writing output... [ 53%] pgr_edgeDisjointPaths
writing output... [ 53%] pgr_edmondsKarp
writing output... [ 54%] pgr_edwardMoore
writing output... [ 55%] pgr_extractVertices
writing output... [ 56%] pgr_findCloseEdges
writing output... [ 56%] pgr_floydWarshall
writing output... [ 57%] pgr_full_version
writing output... [ 58%] pgr_hawickCircuits
writing output... [ 59%] pgr_isPlanar
writing output... [ 60%] pgr_johnson
writing output... [ 60%] pgr_kruskal
writing output... [ 61%] pgr_kruskalBFS
writing output... [ 62%] pgr_kruskalDD
writing output... [ 63%] pgr_kruskalDFS
writing output... [ 63%] pgr_lengauerTarjanDominatorTree
writing output... [ 64%] pgr_lineGraph
writing output... [ 65%] pgr_lineGraphFull
writing output... [ 66%] pgr_makeConnected
writing output... [ 66%] pgr_maxCardinalityMatch
writing output... [ 67%] pgr_maxFlow
writing output... [ 68%] pgr_maxFlowMinCost
writing output... [ 69%] pgr_maxFlowMinCost_Cost
writing output... [ 70%] pgr_nodeNetwork
writing output... [ 70%] pgr_pickDeliver
writing output... [ 71%] pgr_pickDeliverEuclidean
writing output... [ 72%] pgr_prim
writing output... [ 73%] pgr_primBFS
writing output... [ 73%] pgr_primDD
writing output... [ 74%] pgr_primDFS
writing output... [ 75%] pgr_pushRelabel
writing output... [ 76%] pgr_sequentialVertexColoring
writing output... [ 76%] pgr_stoerWagner
writing output... [ 77%] pgr_strongComponents
writing output... [ 78%] pgr_topologicalSort
writing output... [ 79%] pgr_transitiveClosure
writing output... [ 80%] pgr_trsp
writing output... [ 80%] pgr_trspVia
writing output... [ 81%] pgr_trspVia_withPoints
writing output... [ 82%] pgr_trsp_withPoints
writing output... [ 83%] pgr_turnRestrictedPath
writing output... [ 83%] pgr_version
writing output... [ 84%] pgr_vrpOneDepot
writing output... [ 85%] pgr_withPoints
writing output... [ 86%] pgr_withPointsCost
writing output... [ 86%] pgr_withPointsCostMatrix
writing output... [ 87%] pgr_withPointsDD
writing output... [ 88%] pgr_withPointsKSP
writing output... [ 89%] pgr_withPointsVia
writing output... [ 90%] prim-family
writing output... [ 90%] proposed
writing output... [ 91%] reference
writing output... [ 92%] release_notes
writing output... [ 93%] routingFunctions
writing output... [ 93%] sampledata
writing output... [ 94%] spanningTree-family
writing output... [ 95%] support
writing output... [ 96%] topology-functions
writing output... [ 96%] transformation-family
writing output... [ 97%] traversal-family
writing output... [ 98%] via-category
writing output... [ 99%] withPoints-category
writing output... [100%] 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... [ 51%] images/bfs-descending.png
copying images... [ 54%] images/bridge_sampledata.png
copying images... [ 57%] images/cc_sampledata.png
copying images... [ 60%] images/Fig1-originalData.png
copying images... [ 63%] images/Fig1-AscendingOrder.png
copying images... [ 66%] images/Fig2-DescendingOrder.png
copying images... [ 69%] images/Fig2-cost.png
copying images... [ 72%] images/Fig4-costUndirected.png
copying images... [ 75%] images/nonPlanar.png
copying images... [ 78%] images/original.png
copying images... [ 81%] images/transformation.png
copying images... [ 84%] images/before_node_net.png
copying images... [ 87%] images/after_node_net.png
copying images... [ 90%] images/scc_sampledata.png
copying images... [ 93%] images/rightDrivingSide.png
copying images... [ 96%] images/leftDrivingSide.png
copying images... [100%] images/noMatterDrivingSide.png

copying static files... done
copying extra files... done
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-14'
[100%] Built target html-en
make  -f doc/CMakeFiles/html.dir/build.make doc/CMakeFiles/html.dir/depend
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/doc /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/doc /<<PKGBUILDDIR>>/build-14/doc/CMakeFiles/html.dir/DependInfo.cmake --color=
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f doc/CMakeFiles/html.dir/build.make doc/CMakeFiles/html.dir/build
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[5]: Nothing to be done for 'doc/CMakeFiles/html.dir/build'.
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[100%] Built target html
make  -f doc/CMakeFiles/doc.dir/build.make doc/CMakeFiles/doc.dir/depend
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/doc /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/doc /<<PKGBUILDDIR>>/build-14/doc/CMakeFiles/doc.dir/DependInfo.cmake --color=
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f doc/CMakeFiles/doc.dir/build.make doc/CMakeFiles/doc.dir/build
make[5]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[5]: Nothing to be done for 'doc/CMakeFiles/doc.dir/build'.
make[5]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[100%] Built target doc
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-14/CMakeFiles 0
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make[2]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
   create-stamp debian/debhelper-build-stamp
 fakeroot debian/rules binary-arch
dh binary-arch --with sphinxdoc
   dh_testroot -a
   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 14 install ###
make[2]: Entering directory '/<<PKGBUILDDIR>>/build-14'
/usr/bin/cmake -S/<<PKGBUILDDIR>> -B/<<PKGBUILDDIR>>/build-14 --check-build-system CMakeFiles/Makefile.cmake 0
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-14/CMakeFiles /<<PKGBUILDDIR>>/build-14//CMakeFiles/progress.marks
make  -f CMakeFiles/Makefile2 all
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/circuits /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/circuits /<<PKGBUILDDIR>>/build-14/src/circuits/CMakeFiles/circuits.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target circuits
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/circuits/CMakeFiles/circuits.dir/build.make src/circuits/CMakeFiles/circuits.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/circuits/CMakeFiles/circuits.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[  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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dijkstra /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/dijkstra /<<PKGBUILDDIR>>/build-14/src/dijkstra/CMakeFiles/dijkstra.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target dijkstra
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/dijkstra/CMakeFiles/dijkstra.dir/build.make src/dijkstra/CMakeFiles/dijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/dijkstra/CMakeFiles/dijkstra.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[  3%] Built target dijkstra
make  -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/allpairs /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/allpairs /<<PKGBUILDDIR>>/build-14/src/allpairs/CMakeFiles/allpairs.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target allpairs
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/allpairs/CMakeFiles/allpairs.dir/build.make src/allpairs/CMakeFiles/allpairs.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/allpairs/CMakeFiles/allpairs.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[  4%] Built target allpairs
make  -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/common /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/common /<<PKGBUILDDIR>>/build-14/src/common/CMakeFiles/common.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target common
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/common/CMakeFiles/common.dir/build.make src/common/CMakeFiles/common.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/common/CMakeFiles/common.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 16%] Built target common
make  -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/astar /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/astar /<<PKGBUILDDIR>>/build-14/src/astar/CMakeFiles/astar.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target astar
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/astar/CMakeFiles/astar.dir/build.make src/astar/CMakeFiles/astar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/astar/CMakeFiles/astar.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 17%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/driving_distance /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/driving_distance /<<PKGBUILDDIR>>/build-14/src/driving_distance/CMakeFiles/driving_distance.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target driving_distance
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
make[4]: Nothing to be done for 'src/driving_distance/CMakeFiles/driving_distance.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 19%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ksp /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/ksp /<<PKGBUILDDIR>>/build-14/src/ksp/CMakeFiles/ksp.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target ksp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/ksp/CMakeFiles/ksp.dir/build.make src/ksp/CMakeFiles/ksp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/ksp/CMakeFiles/ksp.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 22%] Built target ksp
make  -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/tsp /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/tsp /<<PKGBUILDDIR>>/build-14/src/tsp/CMakeFiles/tsp.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target tsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/tsp/CMakeFiles/tsp.dir/build.make src/tsp/CMakeFiles/tsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/tsp/CMakeFiles/tsp.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 25%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/alpha_shape /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/alpha_shape /<<PKGBUILDDIR>>/build-14/src/alpha_shape/CMakeFiles/alpha_shape.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target alpha_shape
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
make[4]: Nothing to be done for 'src/alpha_shape/CMakeFiles/alpha_shape.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 27%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdAstar /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/bdAstar /<<PKGBUILDDIR>>/build-14/src/bdAstar/CMakeFiles/bdAstar.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target bdAstar
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/bdAstar/CMakeFiles/bdAstar.dir/build.make src/bdAstar/CMakeFiles/bdAstar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/bdAstar/CMakeFiles/bdAstar.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 28%] Built target bdAstar
make  -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bdDijkstra /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/bdDijkstra /<<PKGBUILDDIR>>/build-14/src/bdDijkstra/CMakeFiles/bdDijkstra.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target bdDijkstra
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build.make src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/bdDijkstra/CMakeFiles/bdDijkstra.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 29%] Built target bdDijkstra
make  -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/trsp /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/trsp /<<PKGBUILDDIR>>/build-14/src/trsp/CMakeFiles/trsp.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target trsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/trsp/CMakeFiles/trsp.dir/build.make src/trsp/CMakeFiles/trsp.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/trsp/CMakeFiles/trsp.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 35%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/max_flow /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/max_flow /<<PKGBUILDDIR>>/build-14/src/max_flow/CMakeFiles/max_flow.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target max_flow
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
make[4]: Nothing to be done for 'src/max_flow/CMakeFiles/max_flow.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 41%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/contraction /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/contraction /<<PKGBUILDDIR>>/build-14/src/contraction/CMakeFiles/contraction.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target contraction
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/contraction/CMakeFiles/contraction.dir/build.make src/contraction/CMakeFiles/contraction.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/contraction/CMakeFiles/contraction.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 43%] Built target contraction
make  -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/pickDeliver /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/pickDeliver /<<PKGBUILDDIR>>/build-14/src/pickDeliver/CMakeFiles/pickDeliver.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target pickDeliver
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/pickDeliver/CMakeFiles/pickDeliver.dir/build.make src/pickDeliver/CMakeFiles/pickDeliver.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/pickDeliver/CMakeFiles/pickDeliver.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 52%] Built target pickDeliver
make  -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/withPoints /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/withPoints /<<PKGBUILDDIR>>/build-14/src/withPoints/CMakeFiles/withPoints.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target withPoints
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/withPoints/CMakeFiles/withPoints.dir/build.make src/withPoints/CMakeFiles/withPoints.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/withPoints/CMakeFiles/withPoints.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 55%] Built target withPoints
make  -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/lineGraph /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/lineGraph /<<PKGBUILDDIR>>/build-14/src/lineGraph/CMakeFiles/lineGraph.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target lineGraph
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/lineGraph/CMakeFiles/lineGraph.dir/build.make src/lineGraph/CMakeFiles/lineGraph.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/lineGraph/CMakeFiles/lineGraph.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 56%] Built target lineGraph
make  -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/components /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/components /<<PKGBUILDDIR>>/build-14/src/components/CMakeFiles/components.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target components
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/components/CMakeFiles/components.dir/build.make src/components/CMakeFiles/components.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/components/CMakeFiles/components.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 63%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/bellman_ford /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/bellman_ford /<<PKGBUILDDIR>>/build-14/src/bellman_ford/CMakeFiles/bellman_ford.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target bellman_ford
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
make[4]: Nothing to be done for 'src/bellman_ford/CMakeFiles/bellman_ford.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 65%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/cpp_common /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/cpp_common /<<PKGBUILDDIR>>/build-14/src/cpp_common/CMakeFiles/cpp_common.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target cpp_common
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
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-14'
make[4]: Nothing to be done for 'src/cpp_common/CMakeFiles/cpp_common.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 68%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dagShortestPath /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/dagShortestPath /<<PKGBUILDDIR>>/build-14/src/dagShortestPath/CMakeFiles/dagShortestPath.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target dagShortestPath
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build.make src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/dagShortestPath/CMakeFiles/dagShortestPath.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 69%] Built target dagShortestPath
make  -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/chinese /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/chinese /<<PKGBUILDDIR>>/build-14/src/chinese/CMakeFiles/chinese.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target chinese
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/chinese/CMakeFiles/chinese.dir/build.make src/chinese/CMakeFiles/chinese.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/chinese/CMakeFiles/chinese.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 70%] Built target chinese
make  -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/spanningTree /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/spanningTree /<<PKGBUILDDIR>>/build-14/src/spanningTree/CMakeFiles/spanningTree.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target spanningTree
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/spanningTree/CMakeFiles/spanningTree.dir/build.make src/spanningTree/CMakeFiles/spanningTree.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/spanningTree/CMakeFiles/spanningTree.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 73%] Built target spanningTree
make  -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/mincut /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/mincut /<<PKGBUILDDIR>>/build-14/src/mincut/CMakeFiles/mincut.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target mincut
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/mincut/CMakeFiles/mincut.dir/build.make src/mincut/CMakeFiles/mincut.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/mincut/CMakeFiles/mincut.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 74%] Built target mincut
make  -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/version /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/version /<<PKGBUILDDIR>>/build-14/src/version/CMakeFiles/version.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target version
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/version/CMakeFiles/version.dir/build.make src/version/CMakeFiles/version.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/version/CMakeFiles/version.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 75%] Built target version
make  -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/topologicalSort /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/topologicalSort /<<PKGBUILDDIR>>/build-14/src/topologicalSort/CMakeFiles/topologicalSort.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target topologicalSort
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/topologicalSort/CMakeFiles/topologicalSort.dir/build.make src/topologicalSort/CMakeFiles/topologicalSort.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/topologicalSort/CMakeFiles/topologicalSort.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 76%] Built target topologicalSort
make  -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/transitiveClosure /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/transitiveClosure /<<PKGBUILDDIR>>/build-14/src/transitiveClosure/CMakeFiles/transitiveClosure.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target transitiveClosure
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build.make src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/transitiveClosure/CMakeFiles/transitiveClosure.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 77%] Built target transitiveClosure
make  -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch /<<PKGBUILDDIR>>/build-14/src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target breadthFirstSearch
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build.make src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/breadthFirstSearch/CMakeFiles/breadthFirstSearch.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 79%] Built target breadthFirstSearch
make  -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/traversal /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/traversal /<<PKGBUILDDIR>>/build-14/src/traversal/CMakeFiles/traversal.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target traversal
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/traversal/CMakeFiles/traversal.dir/build.make src/traversal/CMakeFiles/traversal.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/traversal/CMakeFiles/traversal.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 80%] Built target traversal
make  -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/coloring /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/coloring /<<PKGBUILDDIR>>/build-14/src/coloring/CMakeFiles/coloring.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target coloring
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/coloring/CMakeFiles/coloring.dir/build.make src/coloring/CMakeFiles/coloring.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/coloring/CMakeFiles/coloring.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 83%] Built target coloring
make  -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/planar /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/planar /<<PKGBUILDDIR>>/build-14/src/planar/CMakeFiles/planar.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target planar
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/planar/CMakeFiles/planar.dir/build.make src/planar/CMakeFiles/planar.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/planar/CMakeFiles/planar.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 84%] Built target planar
make  -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/dominator /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/dominator /<<PKGBUILDDIR>>/build-14/src/dominator/CMakeFiles/dominator.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target dominator
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/dominator/CMakeFiles/dominator.dir/build.make src/dominator/CMakeFiles/dominator.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/dominator/CMakeFiles/dominator.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 85%] Built target dominator
make  -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/src/ordering /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/src/ordering /<<PKGBUILDDIR>>/build-14/src/ordering/CMakeFiles/ordering.dir/DependInfo.cmake --color=
Consolidate compiler generated dependencies of target ordering
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f src/ordering/CMakeFiles/ordering.dir/build.make src/ordering/CMakeFiles/ordering.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'src/ordering/CMakeFiles/ordering.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 86%] Built target ordering
make  -f CMakeFiles/pgrouting-3.4.dir/build.make CMakeFiles/pgrouting-3.4.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/CMakeFiles/pgrouting-3.4.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f CMakeFiles/pgrouting-3.4.dir/build.make CMakeFiles/pgrouting-3.4.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'CMakeFiles/pgrouting-3.4.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 86%] Built target pgrouting-3.4
make  -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/depend
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/sql /<<PKGBUILDDIR>>/build-14/sql/CMakeFiles/extension_file.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f sql/CMakeFiles/extension_file.dir/build.make sql/CMakeFiles/extension_file.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'sql/CMakeFiles/extension_file.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[ 86%] 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-14'
cd /<<PKGBUILDDIR>>/build-14 && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /<<PKGBUILDDIR>> /<<PKGBUILDDIR>>/sql /<<PKGBUILDDIR>>/build-14 /<<PKGBUILDDIR>>/build-14/sql /<<PKGBUILDDIR>>/build-14/sql/CMakeFiles/update_files.dir/DependInfo.cmake --color=
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
make  -f sql/CMakeFiles/update_files.dir/build.make sql/CMakeFiles/update_files.dir/build
make[4]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[4]: Nothing to be done for 'sql/CMakeFiles/update_files.dir/build'.
make[4]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
[100%] Built target update_files
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
/usr/bin/cmake -E cmake_progress_start /<<PKGBUILDDIR>>/build-14/CMakeFiles 0
make  -f CMakeFiles/Makefile2 preinstall
make[3]: Entering directory '/<<PKGBUILDDIR>>/build-14'
make[3]: Nothing to be done for 'preinstall'.
make[3]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
Install the project...
/usr/bin/cmake -P cmake_install.cmake
-- Install configuration: "Release"
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/lib/postgresql/14/lib/libpgrouting-3.4.so
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.4.0--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.3.5--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.3.4--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.3.3--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.3.2--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.3.1--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.3.0--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.2.2--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.2.1--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.2.0--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.1.4--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.1.3--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.1.2--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.1.1--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.1.0--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.0.6--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.0.5--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.0.4--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.0.3--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.0.2--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.0.1--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.0.0--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--2.6.3--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--2.6.2--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--2.6.1--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--2.6.0--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting--3.4.1.sql
-- Installing: /<<PKGBUILDDIR>>/debian/postgresql-14-pgrouting/usr/share/postgresql/14/extension/pgrouting.control
make[2]: Leaving directory '/<<PKGBUILDDIR>>/build-14'
### End 14 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-14-pgrouting-scripts/usr/share/postgresql/14/extension", found 28 files.
Now have 28 files in total.
Removed 0 files due to nonunique device and inode.
Total size is 9836573 bytes or 9 MiB
Removed 4 files due to unique sizes from list. 24 files left.
Now eliminating candidates based on first bytes: removed 0 files from list. 24 files left.
Now eliminating candidates based on last bytes: removed 0 files from list. 24 files left.
Now eliminating candidates based on sha1 checksum: removed 0 files from list. 24 files left.
It seems like you have 24 files that are not unique
Totally, 7 MiB can be reduced.
Now making hard links.
Making 19 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-14-pgrouting/usr/lib/postgresql/14/lib/libpgrouting-3.4.so contains an unresolvable reference to symbol SPI_palloc: it's probably a plugin
dpkg-shlibdeps: warning: 49 other similar warnings have been skipped (use -v to see them all)
   dh_installdeb -a
   dh_gencontrol -a
dpkg-gencontrol: warning: package postgresql-14-pgrouting: substitution variable ${postgresql:Depends} unused, but is defined
dpkg-gencontrol: warning: package postgresql-14-pgrouting: substitution variable ${postgresql:Depends} unused, but is defined
   dh_md5sums -a
   dh_builddeb -a
dpkg-deb: building package 'postgresql-14-pgrouting-dbgsym' in '../postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb'.
dpkg-deb: building package 'postgresql-14-pgrouting' in '../postgresql-14-pgrouting_3.4.1-1_armhf.deb'.
 dpkg-genbuildinfo --build=any -O../pgrouting_3.4.1-1_armhf.buildinfo
 dpkg-genchanges --build=any -mRaspbian pi4 based autobuilder <root@raspbian.org> -O../pgrouting_3.4.1-1_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 2022-10-14T06:56:26Z

Finished
--------

I: Built successfully

+------------------------------------------------------------------------------+
| Changes                                                                      |
+------------------------------------------------------------------------------+


pgrouting_3.4.1-1_armhf.changes:
--------------------------------

Format: 1.8
Date: Wed, 12 Oct 2022 06:17:22 +0200
Source: pgrouting
Binary: postgresql-14-pgrouting postgresql-14-pgrouting-dbgsym
Architecture: armhf
Version: 3.4.1-1
Distribution: bookworm-staging
Urgency: medium
Maintainer: Raspbian pi4 based autobuilder <root@raspbian.org>
Changed-By: Bas Couwenberg <sebastic@debian.org>
Description:
 postgresql-14-pgrouting - Routing functionality support for PostgreSQL/PostGIS
Changes:
 pgrouting (3.4.1-1) unstable; urgency=medium
 .
   * Team upload.
   * New upstream release.
   * Refresh patches.
Checksums-Sha1:
 00b7875936ffb0b2758354dbdb1e65f065ca7acc 12250 pgrouting_3.4.1-1_armhf.buildinfo
 2ff12f64653fa81bc8235e2d10be2c04ac2819ce 24633176 postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb
 248824dc83a898c906a9fe12a17d8c62d6e54996 688528 postgresql-14-pgrouting_3.4.1-1_armhf.deb
Checksums-Sha256:
 088e12ce86d530bfbe2db0b3b7d0be73edd3f870a518cd1edac82c135645923c 12250 pgrouting_3.4.1-1_armhf.buildinfo
 99d2908af31e771ed5249c8c4a3ca90a32ecaa958e0a652c26738e0c93c7f168 24633176 postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb
 9c6cce38669a388ea258dfd3ff1ca2c34ff5e5e42030d97feccb71df3802f5d9 688528 postgresql-14-pgrouting_3.4.1-1_armhf.deb
Files:
 ed7421b7a0d38c848178aac2350189b5 12250 misc optional pgrouting_3.4.1-1_armhf.buildinfo
 cbcc224ae9010a17b75a24360d4a2d1d 24633176 debug optional postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb
 ded1712dd597f4e75bd3fa878366b3a6 688528 misc optional postgresql-14-pgrouting_3.4.1-1_armhf.deb

+------------------------------------------------------------------------------+
| Buildinfo                                                                    |
+------------------------------------------------------------------------------+

Format: 1.0
Source: pgrouting
Binary: postgresql-14-pgrouting postgresql-14-pgrouting-dbgsym
Architecture: armhf
Version: 3.4.1-1
Checksums-Md5:
 cbcc224ae9010a17b75a24360d4a2d1d 24633176 postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb
 ded1712dd597f4e75bd3fa878366b3a6 688528 postgresql-14-pgrouting_3.4.1-1_armhf.deb
Checksums-Sha1:
 2ff12f64653fa81bc8235e2d10be2c04ac2819ce 24633176 postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb
 248824dc83a898c906a9fe12a17d8c62d6e54996 688528 postgresql-14-pgrouting_3.4.1-1_armhf.deb
Checksums-Sha256:
 99d2908af31e771ed5249c8c4a3ca90a32ecaa958e0a652c26738e0c93c7f168 24633176 postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb
 9c6cce38669a388ea258dfd3ff1ca2c34ff5e5e42030d97feccb71df3802f5d9 688528 postgresql-14-pgrouting_3.4.1-1_armhf.deb
Build-Origin: Raspbian
Build-Architecture: armhf
Build-Date: Fri, 14 Oct 2022 06:56:23 +0000
Build-Path: /<<PKGBUILDDIR>>
Installed-Build-Depends:
 adduser (= 3.129),
 autoconf (= 2.71-2),
 automake (= 1:1.16.5-1.3),
 autopoint (= 0.21-9),
 autotools-dev (= 20220109.1),
 base-files (= 12.2+rpi1),
 base-passwd (= 3.6.1),
 bash (= 5.2~rc2-2),
 binutils (= 2.39-6+rpi1),
 binutils-arm-linux-gnueabihf (= 2.39-6+rpi1),
 binutils-common (= 2.39-6+rpi1),
 bsdextrautils (= 2.38.1-1.1),
 bsdutils (= 1:2.38.1-1.1),
 build-essential (= 12.9),
 bzip2 (= 1.0.8-5+b2),
 ca-certificates (= 20211016),
 clang-14 (= 1:14.0.6-2+rpi1),
 cmake (= 3.24.2-1),
 cmake-data (= 3.24.2-1),
 coreutils (= 9.1-1),
 cpp (= 4:12.2.0-1+rpi1),
 cpp-12 (= 12.2.0-3+rpi1),
 dash (= 0.5.11+git20210903+057cd650a4ed-9),
 debconf (= 1.5.79),
 debhelper (= 13.10),
 debianutils (= 5.7-0.3),
 dh-autoreconf (= 20),
 dh-elpa-helper (= 2.0.14),
 dh-strip-nondeterminism (= 1.13.0-1),
 diffutils (= 1:3.8-1),
 docutils-common (= 0.17.1+dfsg-2),
 dpkg (= 1.21.9+rpi1),
 dpkg-dev (= 1.21.9+rpi1),
 dwz (= 0.14+20220924-2),
 emacsen-common (= 3.0.4),
 file (= 1:5.41-4),
 findutils (= 4.9.0-3),
 fontconfig (= 2.13.1-4.5),
 fontconfig-config (= 2.13.1-4.5),
 fonts-dejavu-core (= 2.37-2),
 fonts-mathjax (= 2.7.9+dfsg-1),
 g++ (= 4:12.2.0-1+rpi1),
 g++-12 (= 12.2.0-3+rpi1),
 gcc (= 4:12.2.0-1+rpi1),
 gcc-11-base (= 11.3.0-8+rpi1),
 gcc-12 (= 12.2.0-3+rpi1),
 gcc-12-base (= 12.2.0-3+rpi1),
 gdal-data (= 3.5.2+dfsg-1),
 gdal-plugins (= 3.5.2+dfsg-1),
 gettext (= 0.21-9),
 gettext-base (= 0.21-9),
 graphviz (= 2.42.2-7),
 grep (= 3.7-1),
 groff-base (= 1.22.4-8),
 gzip (= 1.12-1),
 hostname (= 3.23),
 icu-devtools (= 71.1-3),
 init-system-helpers (= 1.64),
 intltool-debian (= 0.35.0+20060710.5),
 libacl1 (= 2.3.1-1),
 libaec0 (= 1.0.6-1),
 libaom3 (= 3.5.0-1),
 libarchive-zip-perl (= 1.68-1),
 libarchive13 (= 3.6.0-1),
 libarmadillo11 (= 1:11.2.3+dfsg-1),
 libarpack2 (= 3.8.0-1),
 libasan6 (= 11.3.0-8+rpi1),
 libasan8 (= 12.2.0-3+rpi1),
 libatomic1 (= 12.2.0-3+rpi1),
 libattr1 (= 1:2.5.1-1),
 libaudit-common (= 1:3.0.7-1.1),
 libaudit1 (= 1:3.0.7-1.1),
 libbinutils (= 2.39-6+rpi1),
 libblas3 (= 3.10.1-2),
 libblkid1 (= 2.38.1-1.1),
 libblosc1 (= 1.21.1+ds2-3),
 libboost-graph-dev (= 1.74.0.3+b4),
 libboost-graph1.74-dev (= 1.74.0-17),
 libboost-graph1.74.0 (= 1.74.0-17),
 libboost-regex1.74-dev (= 1.74.0-17),
 libboost-regex1.74.0 (= 1.74.0-17),
 libboost-serialization1.74-dev (= 1.74.0-17),
 libboost-serialization1.74.0 (= 1.74.0-17),
 libboost-test1.74-dev (= 1.74.0-17),
 libboost-test1.74.0 (= 1.74.0-17),
 libboost1.74-dev (= 1.74.0-17),
 libbrotli1 (= 1.0.9-2+b2),
 libbsd0 (= 0.11.7-1),
 libbz2-1.0 (= 1.0.8-5+b2),
 libc-bin (= 2.35-1+rpi2),
 libc-dev-bin (= 2.35-1+rpi2),
 libc6 (= 2.35-1+rpi2),
 libc6-dev (= 2.35-1+rpi2),
 libcairo2 (= 1.16.0-6),
 libcap-ng0 (= 0.8.3-1),
 libcap2 (= 1:2.44-1),
 libcc1-0 (= 12.2.0-3+rpi1),
 libcdt5 (= 2.42.2-7),
 libcfitsio9 (= 4.1.0-1),
 libcgraph6 (= 2.42.2-7),
 libclang-common-14-dev (= 1:14.0.6-2+rpi1),
 libclang-cpp14 (= 1:14.0.6-2+rpi1),
 libclang1-14 (= 1:14.0.6-2+rpi1),
 libcom-err2 (= 1.46.6~rc1-1),
 libcrypt-dev (= 1:4.4.28-2),
 libcrypt1 (= 1:4.4.28-2),
 libctf-nobfd0 (= 2.39-6+rpi1),
 libctf0 (= 2.39-6+rpi1),
 libcurl3-gnutls (= 7.85.0-1),
 libcurl3-nss (= 7.85.0-1),
 libcurl4 (= 7.85.0-1),
 libdatrie1 (= 0.2.13-2+b2),
 libdav1d6 (= 1.0.0-2+rpi1),
 libdb5.3 (= 5.3.28+dfsg1-0.10),
 libde265-0 (= 1.0.8-1+rpi1+b1),
 libdebconfclient0 (= 0.264),
 libdebhelper-perl (= 13.10),
 libdeflate0 (= 1.14-1),
 libdpkg-perl (= 1.21.9+rpi1),
 libedit2 (= 3.1-20210910-1),
 libelf1 (= 0.187-2+rpi2),
 libexpat1 (= 2.4.9-1),
 libffi-dev (= 3.4.2-4),
 libffi8 (= 3.4.2-4),
 libfile-stripnondeterminism-perl (= 1.13.0-1),
 libfontconfig1 (= 2.13.1-4.5),
 libfreetype6 (= 2.12.1+dfsg-3),
 libfreexl1 (= 1.0.6-1),
 libfribidi0 (= 1.0.8-2.1),
 libfyba0 (= 4.1.1-7),
 libgc1 (= 1:8.2.2-3),
 libgcc-11-dev (= 11.3.0-8+rpi1),
 libgcc-12-dev (= 12.2.0-3+rpi1),
 libgcc-s1 (= 12.2.0-3+rpi1),
 libgcrypt20 (= 1.10.1-2+b2),
 libgd3 (= 2.3.3-6+b3),
 libgdal31 (= 3.5.2+dfsg-1),
 libgdbm-compat4 (= 1.23-2),
 libgdbm6 (= 1.23-2),
 libgeos-c1v5 (= 3.11.0-2),
 libgeos3.11.0 (= 3.11.0-2),
 libgeotiff5 (= 1.7.1-1+b1),
 libgfortran5 (= 12.2.0-3+rpi1),
 libgif7 (= 5.2.1-2.5),
 libglib2.0-0 (= 2.74.0-2),
 libgmp10 (= 2:6.2.1+dfsg1-1),
 libgnutls30 (= 3.7.7-2),
 libgomp1 (= 12.2.0-3+rpi1),
 libgpg-error0 (= 1.45-2),
 libgraphite2-3 (= 1.3.14-1),
 libgssapi-krb5-2 (= 1.20-1),
 libgts-0.7-5 (= 0.7.6+darcs121130-5),
 libgvc6 (= 2.42.2-7),
 libgvpr2 (= 2.42.2-7),
 libharfbuzz0b (= 5.2.0-2),
 libhdf4-0-alt (= 4.2.15-4),
 libhdf5-103-1 (= 1.10.8+repack-1),
 libhdf5-hl-100 (= 1.10.8+repack-1),
 libheif1 (= 1.13.0-1),
 libhogweed6 (= 3.8.1-2),
 libice6 (= 2:1.0.10-1),
 libicu-dev (= 71.1-3),
 libicu71 (= 71.1-3),
 libidn2-0 (= 2.3.3-1),
 libisl23 (= 0.25-1),
 libjbig0 (= 2.1-3.1+b2),
 libjpeg62-turbo (= 1:2.1.2-1),
 libjs-jquery (= 3.6.1+dfsg+~3.5.14-1),
 libjs-mathjax (= 2.7.9+dfsg-1),
 libjs-sphinxdoc (= 4.5.0-4),
 libjs-underscore (= 1.13.4~dfsg+~1.11.4-1),
 libjson-c5 (= 0.16-2),
 libjson-perl (= 4.10000-1),
 libjsoncpp25 (= 1.9.5-4),
 libk5crypto3 (= 1.20-1),
 libkeyutils1 (= 1.6.3-1),
 libkmlbase1 (= 1.3.0-9),
 libkmldom1 (= 1.3.0-9),
 libkmlengine1 (= 1.3.0-9),
 libkrb5-3 (= 1.20-1),
 libkrb5support0 (= 1.20-1),
 liblab-gamut1 (= 2.42.2-7),
 liblapack3 (= 3.10.1-2),
 liblcms2-2 (= 2.13.1-1),
 libldap-2.5-0 (= 2.5.13+dfsg-2+rpi1),
 liblerc4 (= 4.0.0+ds-1),
 libllvm14 (= 1:14.0.6-2+rpi1),
 libltdl7 (= 2.4.7-4),
 liblz4-1 (= 1.9.4-1+rpi1),
 liblzma5 (= 5.2.5-2.1),
 libmagic-mgc (= 1:5.41-4),
 libmagic1 (= 1:5.41-4),
 libmariadb3 (= 1:10.6.10-1),
 libmd0 (= 1.0.4-2),
 libminizip1 (= 1.1-8+b1),
 libmount1 (= 2.38.1-1.1),
 libmpc3 (= 1.2.1-2),
 libmpdec3 (= 2.5.1-2+rpi1),
 libmpfr6 (= 4.1.0-3),
 libncurses-dev (= 6.3+20220423-2),
 libncurses6 (= 6.3+20220423-2),
 libncursesw6 (= 6.3+20220423-2),
 libnetcdf19 (= 1:4.9.0-3+b2),
 libnettle8 (= 3.8.1-2),
 libnghttp2-14 (= 1.50.0-1),
 libnsl-dev (= 1.3.0-2),
 libnsl2 (= 1.3.0-2),
 libnspr4 (= 2:4.35-1),
 libnss3 (= 2:3.83-1),
 libobjc-11-dev (= 11.3.0-8+rpi1),
 libobjc4 (= 12.2.0-3+rpi1),
 libodbc2 (= 2.3.11-2),
 libodbcinst2 (= 2.3.11-2),
 libogdi4.1 (= 4.1.0+ds-5+b1),
 libopenjp2-7 (= 2.5.0-1),
 libp11-kit0 (= 0.24.1-1),
 libpam-modules (= 1.5.2-2),
 libpam-modules-bin (= 1.5.2-2),
 libpam-runtime (= 1.5.2-2),
 libpam0g (= 1.5.2-2),
 libpango-1.0-0 (= 1.50.10+ds-1),
 libpangocairo-1.0-0 (= 1.50.10+ds-1),
 libpangoft2-1.0-0 (= 1.50.10+ds-1),
 libpathplan4 (= 2.42.2-7),
 libpcre2-8-0 (= 10.40-1+b2),
 libpcre3 (= 2:8.39-14),
 libperl5.34 (= 5.34.0-5),
 libpfm4 (= 4.12.0-1),
 libpipeline1 (= 1.5.6-3),
 libpixman-1-0 (= 0.40.0-1),
 libpng16-16 (= 1.6.38-2),
 libpoppler123 (= 22.08.0-2.1),
 libpq-dev (= 15~rc2-1),
 libpq5 (= 15~rc2-1),
 libprocps8 (= 2:3.3.17-7),
 libproj25 (= 9.1.0-1),
 libpsl5 (= 0.21.0-1.2),
 libpython3-stdlib (= 3.10.6-1),
 libpython3.10-minimal (= 3.10.7-1),
 libpython3.10-stdlib (= 3.10.7-1),
 libqhull-r8.0 (= 2020.2-5),
 libreadline8 (= 8.2-1),
 librhash0 (= 1.4.3-3),
 librtmp1 (= 2.4+20151223.gitfa8646d.1-2+b2),
 librttopo1 (= 1.1.0-2),
 libsasl2-2 (= 2.1.28+dfsg-8),
 libsasl2-modules-db (= 2.1.28+dfsg-8),
 libseccomp2 (= 2.5.4-1+rpi1),
 libselinux1 (= 3.4-1),
 libsemanage-common (= 3.4-1),
 libsemanage2 (= 3.4-1),
 libsepol2 (= 3.4-2),
 libsm6 (= 2:1.2.3-1),
 libsmartcols1 (= 2.38.1-1.1),
 libsnappy1v5 (= 1.1.9-2),
 libspatialite7 (= 5.0.1-2+b2),
 libsqlite3-0 (= 3.39.4-1),
 libssh2-1 (= 1.10.0-3+b1),
 libssl-dev (= 3.0.5-2),
 libssl3 (= 3.0.5-2),
 libstdc++-11-dev (= 11.3.0-8+rpi1),
 libstdc++-12-dev (= 12.2.0-3+rpi1),
 libstdc++6 (= 12.2.0-3+rpi1),
 libsub-override-perl (= 0.09-3),
 libsuperlu5 (= 5.3.0+dfsg1-2),
 libsystemd0 (= 251.4-3+rpi1),
 libsz2 (= 1.0.6-1),
 libtasn1-6 (= 4.19.0-2),
 libthai-data (= 0.1.29-1),
 libthai0 (= 0.1.29-1),
 libtiff5 (= 4.4.0-4),
 libtinfo-dev (= 6.3+20220423-2),
 libtinfo6 (= 6.3+20220423-2),
 libtirpc-common (= 1.3.3+ds-1),
 libtirpc-dev (= 1.3.3+ds-1),
 libtirpc3 (= 1.3.3+ds-1),
 libtool (= 2.4.7-4),
 libubsan1 (= 12.2.0-3+rpi1),
 libuchardet0 (= 0.0.7-1),
 libudev1 (= 251.4-3+rpi1),
 libunistring2 (= 1.0-1),
 liburiparser1 (= 0.9.6+dfsg-1),
 libuuid1 (= 2.38.1-1.1),
 libuv1 (= 1.44.2-1+rpi1),
 libwebp7 (= 1.2.2-2),
 libx11-6 (= 2:1.8.1-2),
 libx11-data (= 2:1.8.1-2),
 libx265-199 (= 3.5-2),
 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.3+debian-3+b1),
 libxext6 (= 2:1.3.4-1),
 libxml2 (= 2.9.14+dfsg-1),
 libxml2-dev (= 2.9.14+dfsg-1),
 libxmu6 (= 2:1.1.3-3),
 libxpm4 (= 1:3.5.12-1),
 libxrender1 (= 1:0.9.10-1.1),
 libxt6 (= 1:1.2.1-1),
 libyaml-0-2 (= 0.2.5-1),
 libz3-4 (= 4.8.12-1),
 libz3-dev (= 4.8.12-1),
 libzstd1 (= 1.5.2+dfsg-1),
 linux-libc-dev (= 5.19.6-1+rpi1),
 llvm-14 (= 1:14.0.6-2+rpi1),
 llvm-14-dev (= 1:14.0.6-2+rpi1),
 llvm-14-linker-tools (= 1:14.0.6-2+rpi1),
 llvm-14-runtime (= 1:14.0.6-2+rpi1),
 llvm-14-tools (= 1:14.0.6-2+rpi1),
 login (= 1:4.11.1+dfsg1-2),
 lsb-base (= 11.4+rpi1),
 m4 (= 1.4.19-1),
 make (= 4.3-4.1),
 man-db (= 2.10.2-3),
 mariadb-common (= 1:10.6.10-1),
 mawk (= 1.3.4.20200120-3.1),
 media-types (= 8.0.0),
 mysql-common (= 5.8+1.0.8),
 ncurses-base (= 6.3+20220423-2),
 ncurses-bin (= 6.3+20220423-2),
 netbase (= 6.3),
 openssl (= 3.0.5-2),
 passwd (= 1:4.11.1+dfsg1-2),
 patch (= 2.7.6-7),
 perl (= 5.34.0-5),
 perl-base (= 5.34.0-5),
 perl-modules-5.34 (= 5.34.0-5),
 po-debconf (= 1.0.21+nmu1),
 postgis (= 3.3.1+dfsg-1),
 postgresql-client-14 (= 14.5-2),
 postgresql-client-common (= 243),
 postgresql-common (= 243),
 postgresql-server-dev-14 (= 14.5-2),
 postgresql-server-dev-all (= 243),
 procps (= 2:3.3.17-7),
 proj-data (= 9.1.0-1),
 python-babel-localedata (= 2.10.3-1),
 python3 (= 3.10.6-1),
 python3-alabaster (= 0.7.12-1),
 python3-babel (= 2.10.3-1),
 python3-certifi (= 2022.6.15-2),
 python3-chardet (= 4.0.0-2),
 python3-charset-normalizer (= 2.0.6-2),
 python3-distutils (= 3.10.7-1),
 python3-docutils (= 0.17.1+dfsg-2),
 python3-idna (= 3.3-1),
 python3-imagesize (= 1.4.1-1),
 python3-importlib-metadata (= 4.12.0-1),
 python3-jinja2 (= 3.0.3-2),
 python3-lib2to3 (= 3.10.7-1),
 python3-markupsafe (= 2.1.1-1),
 python3-minimal (= 3.10.6-1),
 python3-more-itertools (= 8.10.0-2),
 python3-packaging (= 21.3-1.1),
 python3-pkg-resources (= 59.6.0-1.2),
 python3-pygments (= 2.12.0+dfsg-2),
 python3-pyparsing (= 3.0.7-2),
 python3-requests (= 2.27.1+dfsg-1),
 python3-roman (= 3.3-1),
 python3-six (= 1.16.0-4),
 python3-snowballstemmer (= 2.2.0-1),
 python3-sphinx (= 4.5.0-4),
 python3-tz (= 2022.4-1),
 python3-urllib3 (= 1.26.12-1),
 python3-yaml (= 5.4.1-1+b1),
 python3-zipp (= 1.0.0-4),
 python3.10 (= 3.10.7-1),
 python3.10-minimal (= 3.10.7-1),
 rdfind (= 1.5.0-1.1),
 readline-common (= 8.2-1),
 rpcsvc-proto (= 1.4.2-4),
 sed (= 4.8-1),
 sensible-utils (= 0.0.17),
 sgml-base (= 1.30),
 sphinx-common (= 4.5.0-4),
 ssl-cert (= 1.1.2),
 sysvinit-utils (= 3.05-6),
 tar (= 1.34+dfsg-1),
 tzdata (= 2022d-1),
 ucf (= 3.0043),
 unixodbc-common (= 2.3.11-2),
 util-linux (= 2.38.1-1.1),
 util-linux-extra (= 2.38.1-1.1),
 x11-common (= 1:7.7+23),
 xml-core (= 0.18+nmu1),
 xz-utils (= 5.2.5-2.1),
 zlib1g (= 1:1.2.11.dfsg-4.1)
Environment:
 DEB_BUILD_OPTIONS="parallel=4"
 LANG="en_GB.UTF-8"
 LC_ALL="C.UTF-8"
 SOURCE_DATE_EPOCH="1665548242"


+------------------------------------------------------------------------------+
| Package contents                                                             |
+------------------------------------------------------------------------------+


postgresql-14-pgrouting-dbgsym_3.4.1-1_armhf.deb
------------------------------------------------

 new Debian package, version 2.0.
 size 24633176 bytes: control archive=548 bytes.
     410 bytes,    12 lines      control              
     106 bytes,     1 lines      md5sums              
 Package: postgresql-14-pgrouting-dbgsym
 Source: pgrouting
 Version: 3.4.1-1
 Auto-Built-Package: debug-symbols
 Architecture: armhf
 Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
 Installed-Size: 24663
 Depends: postgresql-14-pgrouting (= 3.4.1-1)
 Section: debug
 Priority: optional
 Description: debug symbols for postgresql-14-pgrouting
 Build-Ids: cdfcbc0ce915323152f2b6b536871612d357d32b

drwxr-xr-x root/root         0 2022-10-12 04:17 ./
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/debug/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/debug/.build-id/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/debug/.build-id/cd/
-rw-r--r-- root/root  25244468 2022-10-12 04:17 ./usr/lib/debug/.build-id/cd/fcbc0ce915323152f2b6b536871612d357d32b.debug
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/share/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/share/doc/
lrwxrwxrwx root/root         0 2022-10-12 04:17 ./usr/share/doc/postgresql-14-pgrouting-dbgsym -> postgresql-14-pgrouting


postgresql-14-pgrouting_3.4.1-1_armhf.deb
-----------------------------------------

 new Debian package, version 2.0.
 size 688528 bytes: control archive=788 bytes.
     741 bytes,    17 lines      control              
     339 bytes,     4 lines      md5sums              
 Package: postgresql-14-pgrouting
 Source: pgrouting
 Version: 3.4.1-1
 Architecture: armhf
 Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
 Installed-Size: 2803
 Depends: postgresql-14-pgrouting-scripts (>= 3.4.1-1), postgresql-14, postgresql-14-postgis, postgresql-14-postgis-scripts, libc6 (>= 2.4), libgcc-s1 (>= 3.5), libstdc++6 (>= 11)
 Suggests: postgresql-14-pgrouting-doc
 Provides: postgresql-pgrouting
 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 14.

drwxr-xr-x root/root         0 2022-10-12 04:17 ./
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/postgresql/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/postgresql/14/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/lib/postgresql/14/lib/
-rw-r--r-- root/root   2819488 2022-10-12 04:17 ./usr/lib/postgresql/14/lib/libpgrouting-3.4.so
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/share/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/share/doc/
drwxr-xr-x root/root         0 2022-10-12 04:17 ./usr/share/doc/postgresql-14-pgrouting/
-rw-r--r-- root/root      1758 2022-10-12 04:17 ./usr/share/doc/postgresql-14-pgrouting/changelog.Debian.gz
-rw-r--r-- root/root      8163 2022-10-11 17:08 ./usr/share/doc/postgresql-14-pgrouting/changelog.gz
-rw-r--r-- root/root     28710 2022-10-07 04:56 ./usr/share/doc/postgresql-14-pgrouting/copyright


+------------------------------------------------------------------------------+
| Post Build                                                                   |
+------------------------------------------------------------------------------+


+------------------------------------------------------------------------------+
| Cleanup                                                                      |
+------------------------------------------------------------------------------+

Purging /<<BUILDDIR>>
Not cleaning session: cloned chroot in use

+------------------------------------------------------------------------------+
| Summary                                                                      |
+------------------------------------------------------------------------------+

Build Architecture: armhf
Build Type: any
Build-Space: 405700
Build-Time: 2253
Distribution: bookworm-staging
Host Architecture: armhf
Install-Time: 1747
Job: pgrouting_3.4.1-1
Machine Architecture: armhf
Package: pgrouting
Package-Time: 4045
Source-Version: 3.4.1-1
Space: 405700
Status: successful
Version: 3.4.1-1
--------------------------------------------------------------------------------
Finished at 2022-10-14T06:56:26Z
Build needed 01:07:25, 405700k disk space
Raspbian Package Auto-Building

Build log for pgrouting (3.4.1-1) on armhf
