==> Synchronizing chroot copy [/home/alhp/workspace/chroot/root] -> [build_b139ee0e-b97e-4cd8-892d-f19af876e08e]...done ==> Making package: linbox 1.7.1-2.1 (Tue May 26 09:23:03 2026) ==> Retrieving sources... -> Cloning linbox git repo... Cloning into bare repository '/home/alhp/workspace/build/x86-64-v2/linbox-1.7.1-2/linbox'... ==> Validating source files with sha256sums... linbox ... Passed ==> Making package: linbox 1.7.1-2.1 (Tue May 26 07:23:40 2026) ==> Checking runtime dependencies... ==> Installing missing dependencies... resolving dependencies... looking for conflicting packages... Package (4) New Version Net Change extra/blas 3.12.1-2 0.74 MiB extra/cblas 3.12.1-2 0.34 MiB extra/givaro 4.2.1-2 1.86 MiB extra/fflas-ffpack 2.5.0-3 4.74 MiB Total Installed Size: 7.68 MiB :: Proceed with installation? [Y/n] checking keyring... checking package integrity... loading package files... checking for file conflicts... :: Processing package changes... installing blas... installing cblas... installing givaro... installing fflas-ffpack... :: Running post-transaction hooks... (1/1) Arming ConditionNeedsUpdate... ==> Checking buildtime dependencies... ==> Installing missing dependencies... resolving dependencies... looking for conflicting packages... Package (15) New Version Net Change extra/gf2x 1.3.0-3 0.13 MiB extra/libpng 1.6.58-1 0.58 MiB extra/m4ri 20260122-1 0.33 MiB extra/perl-error 0.17030-3 0.04 MiB extra/perl-mailtools 2.22-3 0.10 MiB extra/perl-timedate 2.35-1 0.15 MiB extra/qd 2.3.24-2 0.67 MiB extra/zlib-ng 2.3.3-1 0.28 MiB extra/flint 3.5.0-1 19.26 MiB extra/fplll 5.5.0-2 27.55 MiB extra/git 2.54.0-1 30.26 MiB extra/iml 1.0.5-4 0.20 MiB extra/lapack 3.12.1-2 15.06 MiB extra/m4rie 20250128-2 0.60 MiB extra/ntl 11.6.0-1 5.25 MiB Total Installed Size: 100.45 MiB :: Proceed with installation? [Y/n] checking keyring... checking package integrity... loading package files... checking for file conflicts... :: Processing package changes... installing iml... installing flint... installing qd... installing fplll... installing perl-error... installing perl-timedate... installing perl-mailtools... installing zlib-ng... installing git... Optional dependencies for git git-zsh-completion: upstream zsh completion tk: gitk and git gui openssh: ssh transport and crypto man: show help with `git command --help` perl-libwww: git svn perl-term-readkey: git svn and interactive.singlekey setting perl-io-socket-ssl: git send-email TLS support perl-authen-sasl: git send-email TLS support perl-cgi: gitweb (web interface) support python: git svn & git p4 [installed] subversion: git svn org.freedesktop.secrets: keyring credential helper libsecret: libsecret credential helper [installed] less: the default pager for git installing lapack... installing libpng... installing m4ri... installing m4rie... installing gf2x... installing ntl... :: Running post-transaction hooks... (1/3) Creating system user accounts... Creating group 'git' with GID 969. Creating user 'git' (git daemon user) with UID 969 and GID 969. (2/3) Reloading system manager configuration... Skipped: Current root is not booted. (3/3) Arming ConditionNeedsUpdate... ==> Retrieving sources... ==> WARNING: Skipping all source file integrity checks. ==> Extracting sources... -> Creating working copy of linbox git repo... Cloning into 'linbox'... done. Switched to a new branch 'makepkg' ==> Starting prepare()... autoreconf: export WARNINGS= autoreconf: Entering directory '.' autoreconf: configure.ac: no obvious need to run autopoint autoreconf: running: aclocal --force -I macros autoreconf: configure.ac: tracing autoreconf: configure.ac: creating directory build-aux autoreconf: running: libtoolize --copy --force libtoolize: putting auxiliary files in AC_CONFIG_AUX_DIR, 'build-aux'. libtoolize: copying file 'build-aux/ltmain.sh' libtoolize: putting macros in AC_CONFIG_MACRO_DIRS, 'macros'. libtoolize: copying file 'macros/libtool.m4' libtoolize: copying file 'macros/ltoptions.m4' libtoolize: copying file 'macros/ltsugar.m4' libtoolize: copying file 'macros/ltversion.m4' libtoolize: copying file 'macros/lt~obsolete.m4' autoreconf: configure.ac: not using Intltool autoreconf: configure.ac: not using Gtkdoc autoreconf: configure.ac: no need to run autopoint (confirmed) autoreconf: running: aclocal --force -I macros autoreconf: running: /usr/bin/autoconf --force configure.ac:49: warning: The macro 'AC_PROG_LIBTOOL' is obsolete. configure.ac:49: You should run autoupdate. macros/libtool.m4:100: AC_PROG_LIBTOOL is expanded from... configure.ac:49: the top level configure.ac:54: warning: The macro 'AC_HEADER_STDC' is obsolete. configure.ac:54: You should run autoupdate. ./lib/autoconf/headers.m4:664: AC_HEADER_STDC is expanded from... configure.ac:54: the top level configure.ac:65: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:65: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... macros/debug.m4:70: AC_COMPILER_NAME is expanded from... configure.ac:65: the top level configure.ac:80: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:80: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1584: AC_ARG_ENABLE is expanded from... macros/debug.m4:26: AC_DEBUG is expanded from... macros/common.m4:25: SET_FLAGS is expanded from... configure.ac:80: the top level configure.ac:80: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:80: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1584: AC_ARG_ENABLE is expanded from... macros/debug.m4:39: AC_PROFILE is expanded from... macros/common.m4:25: SET_FLAGS is expanded from... configure.ac:80: the top level configure.ac:80: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:80: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1584: AC_ARG_ENABLE is expanded from... macros/debug.m4:53: AC_WARNINGS is expanded from... macros/common.m4:25: SET_FLAGS is expanded from... configure.ac:80: the top level configure.ac:85: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:85: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/common.m4:105: ARCH_FLAGS is expanded from... configure.ac:85: the top level configure.ac:114: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:114: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/linbox-misc.m4:26: LB_MISC is expanded from... configure.ac:114: the top level configure.ac:115: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:115: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1584: AC_ARG_ENABLE is expanded from... macros/maple-check.m4:39: LB_DRIVER is expanded from... configure.ac:115: the top level configure.ac:125: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:125: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... macros/lapack-check.m4:28: LB_CHECK_LAPACK is expanded from... configure.ac:125: the top level configure.ac:127: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:127: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/ntl-check.m4:38: LB_CHECK_NTL is expanded from... configure.ac:127: the top level configure.ac:127: warning: The macro 'AC_TRY_LINK' is obsolete. configure.ac:127: You should run autoupdate. ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/ntl-check.m4:38: LB_CHECK_NTL is expanded from... configure.ac:127: the top level configure.ac:127: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:127: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... ./lib/autoconf/general.m4:2950: _AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2967: AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/ntl-check.m4:38: LB_CHECK_NTL is expanded from... configure.ac:127: the top level configure.ac:128: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:128: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/mpfr-check.m4:37: LB_CHECK_MPFR is expanded from... configure.ac:128: the top level configure.ac:128: warning: The macro 'AC_TRY_LINK' is obsolete. configure.ac:128: You should run autoupdate. ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/mpfr-check.m4:37: LB_CHECK_MPFR is expanded from... configure.ac:128: the top level configure.ac:128: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:128: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... ./lib/autoconf/general.m4:2950: _AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2967: AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/mpfr-check.m4:37: LB_CHECK_MPFR is expanded from... configure.ac:128: the top level configure.ac:129: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:129: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/fplll-check.m4:37: LB_CHECK_FPLLL is expanded from... configure.ac:129: the top level configure.ac:129: warning: The macro 'AC_TRY_LINK' is obsolete. configure.ac:129: You should run autoupdate. ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/fplll-check.m4:37: LB_CHECK_FPLLL is expanded from... configure.ac:129: the top level configure.ac:129: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:129: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... ./lib/autoconf/general.m4:2950: _AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2967: AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/fplll-check.m4:37: LB_CHECK_FPLLL is expanded from... configure.ac:129: the top level configure.ac:130: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:130: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/iml-check.m4:37: LB_CHECK_IML is expanded from... configure.ac:130: the top level configure.ac:130: warning: The macro 'AC_TRY_LINK' is obsolete. configure.ac:130: You should run autoupdate. ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/iml-check.m4:37: LB_CHECK_IML is expanded from... configure.ac:130: the top level configure.ac:130: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:130: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... ./lib/autoconf/general.m4:2950: _AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2967: AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/iml-check.m4:37: LB_CHECK_IML is expanded from... configure.ac:130: the top level configure.ac:131: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:131: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/flint-check.m4:37: LB_CHECK_FLINT is expanded from... configure.ac:131: the top level configure.ac:131: warning: The macro 'AC_TRY_LINK' is obsolete. configure.ac:131: You should run autoupdate. ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... macros/flint-check.m4:37: LB_CHECK_FLINT is expanded from... configure.ac:131: the top level configure.ac:131: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:131: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... ./lib/autoconf/general.m4:2950: _AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2967: AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... macros/flint-check.m4:37: LB_CHECK_FLINT is expanded from... configure.ac:131: the top level configure.ac:133: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:133: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/saclib-check.m4:37: LB_CHECK_SACLIB is expanded from... configure.ac:133: the top level configure.ac:133: warning: The macro 'AC_TRY_LINK' is obsolete. configure.ac:133: You should run autoupdate. ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/saclib-check.m4:37: LB_CHECK_SACLIB is expanded from... configure.ac:133: the top level configure.ac:133: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:133: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... ./lib/autoconf/general.m4:2950: _AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2967: AC_LINK_IFELSE is expanded from... ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/saclib-check.m4:37: LB_CHECK_SACLIB is expanded from... configure.ac:133: the top level configure.ac:134: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:134: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/maple-check.m4:55: LB_CHECK_MAPLE is expanded from... configure.ac:134: the top level configure.ac:134: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:134: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1584: AC_ARG_ENABLE is expanded from... macros/maple-check.m4:55: LB_CHECK_MAPLE is expanded from... configure.ac:134: the top level configure.ac:138: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:138: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/linbox-benchmark.m4:25: LB_BENCH is expanded from... configure.ac:138: the top level configure.ac:139: warning: The macro 'AC_TRY_LINK' is obsolete. configure.ac:139: You should run autoupdate. ./lib/autoconf/general.m4:2976: AC_TRY_LINK is expanded from... macros/tinyxml2-check.m4:25: LB_CHECK_XML is expanded from... configure.ac:139: the top level configure.ac:141: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:141: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/linbox-doc.m4:23: LB_DOC is expanded from... configure.ac:141: the top level configure.ac:141: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:141: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1584: AC_ARG_ENABLE is expanded from... macros/linbox-doc.m4:23: LB_DOC is expanded from... configure.ac:141: the top level configure.ac:145: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:145: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/ocl-check.m4:28: LB_CHECK_OCL is expanded from... configure.ac:145: the top level configure.ac:146: warning: The macro 'AC_HELP_STRING' is obsolete. configure.ac:146: You should run autoupdate. ./lib/autoconf/general.m4:205: AC_HELP_STRING is expanded from... ./lib/autoconf/general.m4:1603: AC_ARG_WITH is expanded from... macros/mpi-check.m4:28: LB_CHECK_MPI is expanded from... configure.ac:146: the top level configure.ac:146: warning: The macro 'AC_TRY_RUN' is obsolete. configure.ac:146: You should run autoupdate. ./lib/autoconf/general.m4:3053: AC_TRY_RUN is expanded from... lib/m4sugar/m4sh.m4:696: AS_IF is expanded from... macros/mpi-check.m4:28: LB_CHECK_MPI is expanded from... configure.ac:146: the top level autoreconf: running: /usr/bin/autoheader --force autoreconf: running: automake --add-missing --copy --force-missing configure.ac:46: installing 'build-aux/ar-lib' configure.ac:46: installing 'build-aux/compile' configure.ac:31: installing 'build-aux/config.guess' configure.ac:31: installing 'build-aux/config.sub' configure.ac:33: installing 'build-aux/install-sh' configure.ac:33: installing 'build-aux/missing' benchmarks/Makefile.am: installing 'build-aux/depcomp' parallel-tests: installing 'build-aux/test-driver' tests/Makefile.am:382: warning: variable 'checker_SOURCES' is defined but no program or tests/Makefile.am:382: library has 'checker' as canonical name (possible typo) autoreconf: 'build-aux/config.sub' is updated autoreconf: 'build-aux/config.guess' is updated autoreconf: configure.ac: not running make: --make not given autoreconf: Leaving directory '.' ==> Starting build()... configure: WARNING: unrecognized options: --enable-sage checking build system type... x86_64-pc-linux-gnu checking host system type... x86_64-pc-linux-gnu checking target system type... x86_64-pc-linux-gnu checking for a BSD-compatible install... /usr/bin/install -c checking whether sleep supports fractional seconds... yes checking filesystem timestamp resolution... 0.01 checking whether build environment is sane... yes checking for a race-free mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking xargs -n works... yes checking whether UID '1002' is supported by ustar format... yes checking whether GID '1002' is supported by ustar format... yes checking how to create a ustar tar archive... gnutar checking for g++... g++ checking whether the C++ compiler works... yes checking for C++ compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C++... yes checking whether g++ accepts -g... yes checking whether make supports the include directive... yes (GNU style) checking dependency style of g++... gcc3 checking for gcc... gcc checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C23 features... none needed checking whether gcc understands -c and -o together... yes checking dependency style of gcc... gcc3 checking for ar... ar checking the archiver (ar) interface... ar checking how to print strings... printf checking for a sed that does not truncate output... /usr/bin/sed checking for grep that handles long lines and -e... /usr/bin/grep checking for egrep... /usr/bin/grep -E checking for fgrep... /usr/bin/grep -F checking for ld used by gcc... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking whether ln -s works... yes checking the maximum length of command line arguments... 1572864 checking how to convert x86_64-pc-linux-gnu file names to x86_64-pc-linux-gnu format... func_convert_file_noop checking how to convert x86_64-pc-linux-gnu file names to toolchain format... func_convert_file_noop checking for /usr/bin/ld option to reload object files... -r checking for file... file checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for dlltool... no checking how to associate runtime and link libraries... printf %s\n checking for ranlib... ranlib checking for archiver @FILE support... @ checking for strip... strip checking command to parse /usr/bin/nm -B output from gcc object... ok checking for sysroot... no checking for a working dd... /usr/bin/dd checking how to truncate binary pipes... /usr/bin/dd bs=4096 count=1 checking for mt... no checking if : is a manifest tool... no checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for dlfcn.h... yes checking which variant of shared library versioning to provide... (default) aix checking for objdir... .libs checking if gcc supports -fno-rtti -fno-exceptions... no checking for gcc option to produce PIC... -fPIC -DPIC checking if gcc PIC flag -fPIC -DPIC works... yes checking if gcc static flag -static works... yes checking if gcc supports -c -o file.o... yes checking if gcc supports -c -o file.o... (cached) yes checking whether the gcc linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking whether -lc should be explicitly linked in... no checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... yes checking whether to build static libraries... yes checking how to run the C++ preprocessor... g++ -E checking for ld used by g++... /usr/bin/ld -m elf_x86_64 checking if the linker (/usr/bin/ld -m elf_x86_64) is GNU ld... yes checking whether the g++ linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking for g++ option to produce PIC... -fPIC -DPIC checking if g++ PIC flag -fPIC -DPIC works... yes checking if g++ static flag -static works... yes checking if g++ supports -c -o file.o... yes checking if g++ supports -c -o file.o... (cached) yes checking whether the g++ linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... (cached) GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for egrep... (cached) /usr/bin/grep -E checking for float.h... yes checking for limits.h... yes checking for stddef.h... yes checking for stdlib.h... (cached) yes checking for string.h... (cached) yes checking for sys/time.h... yes checking for stdint.h... (cached) yes checking for pthread.h... yes checking for egrep... (cached) /usr/bin/grep -E checking for a sed that does not truncate output... (cached) /usr/bin/sed ## --------------------------------------- ## ## START LINBOX CONFIG ## ## --------------------------------------- ## checking for family name of compiler... gcc checking whether g++ supports C++11 features by default... yes --------------------------------------- checking whether to enable debugging options in the library... no checking whether to enable profiling everything in the library... no checking whether to enable warnings when compiling the library... no checking whether C++ compiler accepts -march=native... yes --------------------------------------- checking size of char... 1 checking size of short... 2 checking size of int... 4 checking size of long... 8 checking size of long long... 8 checking size of __int64_t... 8 checking for __int128_t... yes checking whether byte ordering is bigendian... no --------------------------------------- Default path = /usr /usr/local checking whether to compile the drivers... no checking for pkg-config... /usr/bin/pkg-config checking pkg-config is at least version 0.9.0... yes checking for fflas-ffpack >= 2.5.0... yes --------------------------------------- checking for LAPACK in fflas-ffpack... no checking for NTL >= 5.0... found checking for MPFR... found checking for FPLLL >= 4.0.1... found checking for IML... found checking for FLINT... found --------------------------------------- checking whether gnuplot works... no You must have gnuplot installed to create benchmark graphics for LinBox. Download the appropriate package for your distribution, or get the source tarball from http://www.gnuplot.info/download.html checking whether ps2pdf works... no You must have ps2pdf installed to create pdf benchmarks graphics for LinBox. Download the appropriate package for your distribution, or get the source tarball from http://pages.cs.wisc.edu/~ghost/ checking if tinyxml2 is available... no configure: WARNING: tinyxml2 is not installed (no import/export of benchmarks). checking whether to build documentation... no checking whether dot works... no --------------------------------------- checking for OpenCL... not found checking for MPI... not found --------------------------------------- --------------------------------------- LINBOX_CXXFLAGS = -O2 -Wall -DNDEBUG -UDEBUG ## --------------------------------------- ## ## END LINBOX CONFIG ## ## --------------------------------------- ## checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating linbox-config config.status: creating examples/Makefile config.status: creating examples/data/Makefile config.status: creating doc/Makefile config.status: creating linbox/Makefile config.status: creating linbox/algorithms/Makefile config.status: creating linbox/algorithms/dixon-solver/Makefile config.status: creating linbox/algorithms/gauss/Makefile config.status: creating linbox/algorithms/matrix-blas3/Makefile config.status: creating linbox/algorithms/opencl-kernels/Makefile config.status: creating linbox/algorithms/polynomial-matrix/Makefile config.status: creating linbox/blackbox/Makefile config.status: creating linbox/element/Makefile config.status: creating linbox/field/Makefile config.status: creating linbox/matrix/Makefile config.status: creating linbox/matrix/sparsematrix/Makefile config.status: creating linbox/matrix/densematrix/Makefile config.status: creating linbox/matrix/matrixdomain/Makefile config.status: creating linbox/matrix/sliced3/Makefile config.status: creating linbox/randiter/Makefile config.status: creating linbox/ring/Makefile config.status: creating linbox/ring/ntl/Makefile config.status: creating linbox/ring/modular/Makefile config.status: creating linbox/solutions/Makefile config.status: creating linbox/solutions/solve/Makefile config.status: creating linbox/solutions/echelon/Makefile config.status: creating linbox/util/Makefile config.status: creating linbox/util/formats/Makefile config.status: creating linbox/vector/Makefile config.status: creating linbox/polynomial/Makefile config.status: creating tests/Makefile config.status: creating tests/data/Makefile config.status: creating tests/matrix/Makefile config.status: creating interfaces/Makefile config.status: creating interfaces/driver/Makefile config.status: creating interfaces/maple/Makefile config.status: creating interfaces/kaapi/Makefile config.status: creating benchmarks/Makefile config.status: creating benchmarks/data/Makefile config.status: creating benchmarks/matrix/Makefile config.status: creating linbox.pc config.status: creating config.h config.status: executing linbox/config.h commands config.status: creating linbox/config.h - prefix __LINBOX for config.h defines config.status: executing depfiles commands config.status: executing libtool commands configure: WARNING: unrecognized options: --enable-sage make all-recursive make[1]: Entering directory '/startdir/src/linbox' Making all in linbox make[2]: Entering directory '/startdir/src/linbox/linbox' Making all in util make[3]: Entering directory '/startdir/src/linbox/linbox/util' Making all in formats make[4]: Entering directory '/startdir/src/linbox/linbox/util/formats' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/util/formats' make[4]: Entering directory '/startdir/src/linbox/linbox/util' depbase=`echo error.lo | sed 's|[^/]*$|.deps/&|;s|\.lo$||'`;\ /bin/sh ../../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT error.lo -MD -MP -MF $depbase.Tpo -c -o error.lo error.C &&\ mv -f $depbase.Tpo $depbase.Plo depbase=`echo debug.lo | sed 's|[^/]*$|.deps/&|;s|\.lo$||'`;\ /bin/sh ../../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT debug.lo -MD -MP -MF $depbase.Tpo -c -o debug.lo debug.C &&\ mv -f $depbase.Tpo $depbase.Plo libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT error.lo -MD -MP -MF .deps/error.Tpo -c error.C -fPIC -DPIC -o .libs/error.o libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT debug.lo -MD -MP -MF .deps/debug.Tpo -c debug.C -fPIC -DPIC -o .libs/debug.o libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT error.lo -MD -MP -MF .deps/error.Tpo -c error.C -o error.o >/dev/null 2>&1 libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT debug.lo -MD -MP -MF .deps/debug.Tpo -c debug.C -o debug.o >/dev/null 2>&1 /bin/sh ../../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o libutil.la error.lo debug.lo libtool: link: ar cr .libs/libutil.a .libs/error.o .libs/debug.o libtool: link: ranlib .libs/libutil.a libtool: link: ( cd ".libs" && rm -f "libutil.la" && ln -s "../libutil.la" "libutil.la" ) make[4]: Leaving directory '/startdir/src/linbox/linbox/util' make[3]: Leaving directory '/startdir/src/linbox/linbox/util' Making all in element make[3]: Entering directory '/startdir/src/linbox/linbox/element' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/linbox/element' Making all in field make[3]: Entering directory '/startdir/src/linbox/linbox/field' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/linbox/field' Making all in randiter make[3]: Entering directory '/startdir/src/linbox/linbox/randiter' depbase=`echo mersenne-twister.lo | sed 's|[^/]*$|.deps/&|;s|\.lo$||'`;\ /bin/sh ../../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT mersenne-twister.lo -MD -MP -MF $depbase.Tpo -c -o mersenne-twister.lo mersenne-twister.C &&\ mv -f $depbase.Tpo $depbase.Plo libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT mersenne-twister.lo -MD -MP -MF .deps/mersenne-twister.Tpo -c mersenne-twister.C -fPIC -DPIC -o .libs/mersenne-twister.o libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT mersenne-twister.lo -MD -MP -MF .deps/mersenne-twister.Tpo -c mersenne-twister.C -o mersenne-twister.o >/dev/null 2>&1 /bin/sh ../../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o libranditer.la mersenne-twister.lo libtool: link: ar cr .libs/libranditer.a .libs/mersenne-twister.o libtool: link: ranlib .libs/libranditer.a libtool: link: ( cd ".libs" && rm -f "libranditer.la" && ln -s "../libranditer.la" "libranditer.la" ) make[3]: Leaving directory '/startdir/src/linbox/linbox/randiter' Making all in vector make[3]: Entering directory '/startdir/src/linbox/linbox/vector' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/linbox/vector' Making all in matrix make[3]: Entering directory '/startdir/src/linbox/linbox/matrix' Making all in sparsematrix make[4]: Entering directory '/startdir/src/linbox/linbox/matrix/sparsematrix' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/matrix/sparsematrix' Making all in densematrix make[4]: Entering directory '/startdir/src/linbox/linbox/matrix/densematrix' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/matrix/densematrix' Making all in matrixdomain make[4]: Entering directory '/startdir/src/linbox/linbox/matrix/matrixdomain' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/matrix/matrixdomain' Making all in sliced3 make[4]: Entering directory '/startdir/src/linbox/linbox/matrix/sliced3' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/matrix/sliced3' make[4]: Entering directory '/startdir/src/linbox/linbox/matrix' make[4]: Nothing to be done for 'all-am'. make[4]: Leaving directory '/startdir/src/linbox/linbox/matrix' make[3]: Leaving directory '/startdir/src/linbox/linbox/matrix' Making all in blackbox make[3]: Entering directory '/startdir/src/linbox/linbox/blackbox' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/linbox/blackbox' Making all in algorithms make[3]: Entering directory '/startdir/src/linbox/linbox/algorithms' Making all in dixon-solver make[4]: Entering directory '/startdir/src/linbox/linbox/algorithms/dixon-solver' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/algorithms/dixon-solver' Making all in gauss make[4]: Entering directory '/startdir/src/linbox/linbox/algorithms/gauss' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/algorithms/gauss' Making all in opencl-kernels make[4]: Entering directory '/startdir/src/linbox/linbox/algorithms/opencl-kernels' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/algorithms/opencl-kernels' Making all in matrix-blas3 make[4]: Entering directory '/startdir/src/linbox/linbox/algorithms/matrix-blas3' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/algorithms/matrix-blas3' Making all in polynomial-matrix make[4]: Entering directory '/startdir/src/linbox/linbox/algorithms/polynomial-matrix' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/algorithms/polynomial-matrix' make[4]: Entering directory '/startdir/src/linbox/linbox/algorithms' depbase=`echo diophantine-solver.lo | sed 's|[^/]*$|.deps/&|;s|\.lo$||'`;\ /bin/sh ../../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT diophantine-solver.lo -MD -MP -MF $depbase.Tpo -c -o diophantine-solver.lo diophantine-solver.C &&\ mv -f $depbase.Tpo $depbase.Plo libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT diophantine-solver.lo -MD -MP -MF .deps/diophantine-solver.Tpo -c diophantine-solver.C -fPIC -DPIC -o .libs/diophantine-solver.o libtool: compile: g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT diophantine-solver.lo -MD -MP -MF .deps/diophantine-solver.Tpo -c diophantine-solver.C -o diophantine-solver.o >/dev/null 2>&1 /bin/sh ../../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o libalgorithms.la diophantine-solver.lo libtool: link: ar cr .libs/libalgorithms.a .libs/diophantine-solver.o libtool: link: ranlib .libs/libalgorithms.a libtool: link: ( cd ".libs" && rm -f "libalgorithms.la" && ln -s "../libalgorithms.la" "libalgorithms.la" ) make[4]: Leaving directory '/startdir/src/linbox/linbox/algorithms' make[3]: Leaving directory '/startdir/src/linbox/linbox/algorithms' Making all in solutions make[3]: Entering directory '/startdir/src/linbox/linbox/solutions' Making all in solve make[4]: Entering directory '/startdir/src/linbox/linbox/solutions/solve' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/solutions/solve' Making all in echelon make[4]: Entering directory '/startdir/src/linbox/linbox/solutions/echelon' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/solutions/echelon' make[4]: Entering directory '/startdir/src/linbox/linbox/solutions' make[4]: Nothing to be done for 'all-am'. make[4]: Leaving directory '/startdir/src/linbox/linbox/solutions' make[3]: Leaving directory '/startdir/src/linbox/linbox/solutions' Making all in ring make[3]: Entering directory '/startdir/src/linbox/linbox/ring' Making all in ntl make[4]: Entering directory '/startdir/src/linbox/linbox/ring/ntl' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/ring/ntl' Making all in modular make[4]: Entering directory '/startdir/src/linbox/linbox/ring/modular' make[4]: Nothing to be done for 'all'. make[4]: Leaving directory '/startdir/src/linbox/linbox/ring/modular' make[4]: Entering directory '/startdir/src/linbox/linbox/ring' make[4]: Nothing to be done for 'all-am'. make[4]: Leaving directory '/startdir/src/linbox/linbox/ring' make[3]: Leaving directory '/startdir/src/linbox/linbox/ring' Making all in polynomial make[3]: Entering directory '/startdir/src/linbox/linbox/polynomial' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/linbox/polynomial' make[3]: Entering directory '/startdir/src/linbox/linbox' depbase=`echo dummy.lo | sed 's|[^/]*$|.deps/&|;s|\.lo$||'`;\ /bin/sh ../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I.. -I../linbox -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT dummy.lo -MD -MP -MF $depbase.Tpo -c -o dummy.lo dummy.C &&\ mv -f $depbase.Tpo $depbase.Plo libtool: compile: g++ -DHAVE_CONFIG_H -I. -I.. -I../linbox -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT dummy.lo -MD -MP -MF .deps/dummy.Tpo -c dummy.C -fPIC -DPIC -o .libs/dummy.o libtool: compile: g++ -DHAVE_CONFIG_H -I. -I.. -I../linbox -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT dummy.lo -MD -MP -MF .deps/dummy.Tpo -c dummy.C -o dummy.o >/dev/null 2>&1 /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o liblinbox.la -rpath /usr/lib dummy.lo util/libutil.la randiter/libranditer.la algorithms/libalgorithms.la -lntl -lmpfr -lfplll -liml -lflint libtool: link: g++ -fPIC -DPIC -Wl,-O1,--as-needed -shared -nostdlib /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crti.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtbeginS.o .libs/dummy.o -Wl,--whole-archive util/.libs/libutil.a randiter/.libs/libranditer.a algorithms/.libs/libalgorithms.a -Wl,--no-whole-archive -Wl,--as-needed -lntl -lmpfr -lfplll -liml -lflint -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1 -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib -L/lib/../lib -L/usr/lib/../lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../.. -L/lib -L/usr/lib -lstdc++ -lm -lgcc_s -latomic_asneeded -lc -lgcc_s /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/crtendS.o /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/../../../../lib/crtn.o -O2 -Wall -march=x86-64-v2 -O3 -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -Wl,-O1 -Wl,--sort-common -Wl,-z -Wl,relro -Wl,-z -Wl,now -Wl,-z -Wl,pack-relative-relocs -flto=auto -pthread -Wl,-soname -Wl,liblinbox.so.0 -o .libs/liblinbox.so.0.0.0 libtool: link: (cd ".libs" && rm -f "liblinbox.so.0" && ln -s "liblinbox.so.0.0.0" "liblinbox.so.0") libtool: link: (cd ".libs" && rm -f "liblinbox.so" && ln -s "liblinbox.so.0.0.0" "liblinbox.so") libtool: link: (cd .libs/liblinbox.lax/libutil.a && ar x "/startdir/src/linbox/linbox/util/.libs/libutil.a") libtool: link: (cd .libs/liblinbox.lax/libranditer.a && ar x "/startdir/src/linbox/linbox/randiter/.libs/libranditer.a") libtool: link: (cd .libs/liblinbox.lax/libalgorithms.a && ar x "/startdir/src/linbox/linbox/algorithms/.libs/libalgorithms.a") libtool: link: ar cr .libs/liblinbox.a dummy.o .libs/liblinbox.lax/libutil.a/debug.o .libs/liblinbox.lax/libutil.a/error.o .libs/liblinbox.lax/libranditer.a/mersenne-twister.o .libs/liblinbox.lax/libalgorithms.a/diophantine-solver.o libtool: link: ranlib .libs/liblinbox.a libtool: link: rm -fr .libs/liblinbox.lax libtool: link: ( cd ".libs" && rm -f "liblinbox.la" && ln -s "../liblinbox.la" "liblinbox.la" ) make[3]: Leaving directory '/startdir/src/linbox/linbox' make[2]: Leaving directory '/startdir/src/linbox/linbox' Making all in benchmarks make[2]: Entering directory '/startdir/src/linbox/benchmarks' Making all in data make[3]: Entering directory '/startdir/src/linbox/benchmarks/data' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/benchmarks/data' Making all in matrix make[3]: Entering directory '/startdir/src/linbox/benchmarks/matrix' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/benchmarks/matrix' make[3]: Entering directory '/startdir/src/linbox/benchmarks' depbase=`echo benchmark.lo | sed 's|[^/]*$|.deps/&|;s|\.lo$||'`;\ /bin/sh ../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DDISABLE_COMMENTATOR -DLinBoxSrcOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT benchmark.lo -MD -MP -MF $depbase.Tpo -c -o benchmark.lo benchmark.C &&\ mv -f $depbase.Tpo $depbase.Plo libtool: compile: g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DDISABLE_COMMENTATOR -DLinBoxSrcOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT benchmark.lo -MD -MP -MF .deps/benchmark.Tpo -c benchmark.C -fPIC -DPIC -o .libs/benchmark.o libtool: compile: g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DDISABLE_COMMENTATOR -DLinBoxSrcOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT benchmark.lo -MD -MP -MF .deps/benchmark.Tpo -c benchmark.C -o benchmark.o >/dev/null 2>&1 /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o libbenchmarks.la benchmark.lo libtool: link: ar cr .libs/libbenchmarks.a .libs/benchmark.o libtool: link: ranlib .libs/libbenchmarks.a libtool: link: ( cd ".libs" && rm -f "libbenchmarks.la" && ln -s "../libbenchmarks.la" "libbenchmarks.la" ) make[3]: Leaving directory '/startdir/src/linbox/benchmarks' make[2]: Leaving directory '/startdir/src/linbox/benchmarks' Making all in tests make[2]: Entering directory '/startdir/src/linbox/tests' Making all in data make[3]: Entering directory '/startdir/src/linbox/tests/data' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/tests/data' Making all in matrix make[3]: Entering directory '/startdir/src/linbox/tests/matrix' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/tests/matrix' make[3]: Entering directory '/startdir/src/linbox/tests' make[3]: Nothing to be done for 'all-am'. make[3]: Leaving directory '/startdir/src/linbox/tests' make[2]: Leaving directory '/startdir/src/linbox/tests' Making all in interfaces make[2]: Entering directory '/startdir/src/linbox/interfaces' Making all in driver make[3]: Entering directory '/startdir/src/linbox/interfaces/driver' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/interfaces/driver' Making all in kaapi make[3]: Entering directory '/startdir/src/linbox/interfaces/kaapi' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/interfaces/kaapi' Making all in maple make[3]: Entering directory '/startdir/src/linbox/interfaces/maple' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/interfaces/maple' make[3]: Entering directory '/startdir/src/linbox/interfaces' make[3]: Nothing to be done for 'all-am'. make[3]: Leaving directory '/startdir/src/linbox/interfaces' make[2]: Leaving directory '/startdir/src/linbox/interfaces' Making all in doc make[2]: Entering directory '/startdir/src/linbox/doc' make[2]: Nothing to be done for 'all'. make[2]: Leaving directory '/startdir/src/linbox/doc' Making all in examples make[2]: Entering directory '/startdir/src/linbox/examples' Making all in data make[3]: Entering directory '/startdir/src/linbox/examples/data' make[3]: Nothing to be done for 'all'. make[3]: Leaving directory '/startdir/src/linbox/examples/data' make[3]: Entering directory '/startdir/src/linbox/examples' make[3]: Nothing to be done for 'all-am'. make[3]: Leaving directory '/startdir/src/linbox/examples' make[2]: Leaving directory '/startdir/src/linbox/examples' make[2]: Entering directory '/startdir/src/linbox' make[2]: Leaving directory '/startdir/src/linbox' make[1]: Leaving directory '/startdir/src/linbox' ==> Starting check()... Making check in linbox make[1]: Entering directory '/startdir/src/linbox/linbox' Making check in util make[2]: Entering directory '/startdir/src/linbox/linbox/util' Making check in formats make[3]: Entering directory '/startdir/src/linbox/linbox/util/formats' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/util/formats' make[3]: Entering directory '/startdir/src/linbox/linbox/util' make[3]: Nothing to be done for 'check-am'. make[3]: Leaving directory '/startdir/src/linbox/linbox/util' make[2]: Leaving directory '/startdir/src/linbox/linbox/util' Making check in element make[2]: Entering directory '/startdir/src/linbox/linbox/element' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/linbox/element' Making check in field make[2]: Entering directory '/startdir/src/linbox/linbox/field' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/linbox/field' Making check in randiter make[2]: Entering directory '/startdir/src/linbox/linbox/randiter' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/linbox/randiter' Making check in vector make[2]: Entering directory '/startdir/src/linbox/linbox/vector' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/linbox/vector' Making check in matrix make[2]: Entering directory '/startdir/src/linbox/linbox/matrix' Making check in sparsematrix make[3]: Entering directory '/startdir/src/linbox/linbox/matrix/sparsematrix' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/matrix/sparsematrix' Making check in densematrix make[3]: Entering directory '/startdir/src/linbox/linbox/matrix/densematrix' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/matrix/densematrix' Making check in matrixdomain make[3]: Entering directory '/startdir/src/linbox/linbox/matrix/matrixdomain' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/matrix/matrixdomain' Making check in sliced3 make[3]: Entering directory '/startdir/src/linbox/linbox/matrix/sliced3' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/matrix/sliced3' make[3]: Entering directory '/startdir/src/linbox/linbox/matrix' make[3]: Nothing to be done for 'check-am'. make[3]: Leaving directory '/startdir/src/linbox/linbox/matrix' make[2]: Leaving directory '/startdir/src/linbox/linbox/matrix' Making check in blackbox make[2]: Entering directory '/startdir/src/linbox/linbox/blackbox' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/linbox/blackbox' Making check in algorithms make[2]: Entering directory '/startdir/src/linbox/linbox/algorithms' Making check in dixon-solver make[3]: Entering directory '/startdir/src/linbox/linbox/algorithms/dixon-solver' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/algorithms/dixon-solver' Making check in gauss make[3]: Entering directory '/startdir/src/linbox/linbox/algorithms/gauss' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/algorithms/gauss' Making check in opencl-kernels make[3]: Entering directory '/startdir/src/linbox/linbox/algorithms/opencl-kernels' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/algorithms/opencl-kernels' Making check in matrix-blas3 make[3]: Entering directory '/startdir/src/linbox/linbox/algorithms/matrix-blas3' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/algorithms/matrix-blas3' Making check in polynomial-matrix make[3]: Entering directory '/startdir/src/linbox/linbox/algorithms/polynomial-matrix' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/algorithms/polynomial-matrix' make[3]: Entering directory '/startdir/src/linbox/linbox/algorithms' make[3]: Nothing to be done for 'check-am'. make[3]: Leaving directory '/startdir/src/linbox/linbox/algorithms' make[2]: Leaving directory '/startdir/src/linbox/linbox/algorithms' Making check in solutions make[2]: Entering directory '/startdir/src/linbox/linbox/solutions' Making check in solve make[3]: Entering directory '/startdir/src/linbox/linbox/solutions/solve' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/solutions/solve' Making check in echelon make[3]: Entering directory '/startdir/src/linbox/linbox/solutions/echelon' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/solutions/echelon' make[3]: Entering directory '/startdir/src/linbox/linbox/solutions' make[3]: Nothing to be done for 'check-am'. make[3]: Leaving directory '/startdir/src/linbox/linbox/solutions' make[2]: Leaving directory '/startdir/src/linbox/linbox/solutions' Making check in ring make[2]: Entering directory '/startdir/src/linbox/linbox/ring' Making check in ntl make[3]: Entering directory '/startdir/src/linbox/linbox/ring/ntl' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/ring/ntl' Making check in modular make[3]: Entering directory '/startdir/src/linbox/linbox/ring/modular' make[3]: Nothing to be done for 'check'. make[3]: Leaving directory '/startdir/src/linbox/linbox/ring/modular' make[3]: Entering directory '/startdir/src/linbox/linbox/ring' make[3]: Nothing to be done for 'check-am'. make[3]: Leaving directory '/startdir/src/linbox/linbox/ring' make[2]: Leaving directory '/startdir/src/linbox/linbox/ring' Making check in polynomial make[2]: Entering directory '/startdir/src/linbox/linbox/polynomial' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/linbox/polynomial' make[2]: Entering directory '/startdir/src/linbox/linbox' make[2]: Nothing to be done for 'check-am'. make[2]: Leaving directory '/startdir/src/linbox/linbox' make[1]: Leaving directory '/startdir/src/linbox/linbox' Making check in benchmarks make[1]: Entering directory '/startdir/src/linbox/benchmarks' Making check in data make[2]: Entering directory '/startdir/src/linbox/benchmarks/data' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/benchmarks/data' Making check in matrix make[2]: Entering directory '/startdir/src/linbox/benchmarks/matrix' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/benchmarks/matrix' make[2]: Entering directory '/startdir/src/linbox/benchmarks' make[2]: Nothing to be done for 'check-am'. make[2]: Leaving directory '/startdir/src/linbox/benchmarks' make[1]: Leaving directory '/startdir/src/linbox/benchmarks' Making check in tests make[1]: Entering directory '/startdir/src/linbox/tests' Making check in data make[2]: Entering directory '/startdir/src/linbox/tests/data' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/tests/data' Making check in matrix make[2]: Entering directory '/startdir/src/linbox/tests/matrix' make[2]: Nothing to be done for 'check'. make[2]: Leaving directory '/startdir/src/linbox/tests/matrix' make[2]: Entering directory '/startdir/src/linbox/tests' make check-TESTS make[3]: Entering directory '/startdir/src/linbox/tests' make[4]: Entering directory '/startdir/src/linbox/tests' depbase=`echo test-solve.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-solve.o -MD -MP -MF $depbase.Tpo -c -o test-solve.o test-solve.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-solve-full.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-solve-full.o -MD -MP -MF $depbase.Tpo -c -o test-solve-full.o test-solve-full.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-smith-form-valence.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-smith-form-valence.o -MD -MP -MF $depbase.Tpo -c -o test-smith-form-valence.o test-smith-form-valence.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-local-smith-form-sparseelim.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-local-smith-form-sparseelim.o -MD -MP -MF $depbase.Tpo -c -o test-local-smith-form-sparseelim.o test-local-smith-form-sparseelim.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-smith-form.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-smith-form.o -MD -MP -MF $depbase.Tpo -c -o test-smith-form.o test-smith-form.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-smith-form-adaptive.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-smith-form-adaptive.o -MD -MP -MF $depbase.Tpo -c -o test-smith-form-adaptive.o test-smith-form-adaptive.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-smith-form-iliopoulos.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-smith-form-iliopoulos.o -MD -MP -MF $depbase.Tpo -c -o test-smith-form-iliopoulos.o test-smith-form-iliopoulos.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-smith-form-local.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-smith-form-local.o -MD -MP -MF $depbase.Tpo -c -o test-smith-form-local.o test-smith-form-local.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-last-invariant-factor.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-last-invariant-factor.o -MD -MP -MF $depbase.Tpo -c -o test-last-invariant-factor.o test-last-invariant-factor.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-qlup.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-qlup.o -MD -MP -MF $depbase.Tpo -c -o test-qlup.o test-qlup.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-det.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-det.o -MD -MP -MF $depbase.Tpo -c -o test-det.o test-det.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-regression.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-regression.o -MD -MP -MF $depbase.Tpo -c -o test-regression.o test-regression.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-regression2.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-regression2.o -MD -MP -MF $depbase.Tpo -c -o test-regression2.o test-regression2.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-rank-ex.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-rank-ex.o -MD -MP -MF $depbase.Tpo -c -o test-rank-ex.o test-rank-ex.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-rank-u32.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-rank-u32.o -MD -MP -MF $depbase.Tpo -c -o test-rank-u32.o test-rank-u32.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-rank-md.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-rank-md.o -MD -MP -MF $depbase.Tpo -c -o test-rank-md.o test-rank-md.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-rank-Int.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-rank-Int.o -MD -MP -MF $depbase.Tpo -c -o test-rank-Int.o test-rank-Int.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-frobenius.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-frobenius.o -MD -MP -MF $depbase.Tpo -c -o test-frobenius.o test-frobenius.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-rational-solver.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-rational-solver.o -MD -MP -MF $depbase.Tpo -c -o test-rational-solver.o test-rational-solver.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-polynomial-matrix.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-polynomial-matrix.o -MD -MP -MF $depbase.Tpo -c -o test-polynomial-matrix.o test-polynomial-matrix.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-rational-solver-adaptive.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-rational-solver-adaptive.o -MD -MP -MF $depbase.Tpo -c -o test-rational-solver-adaptive.o test-rational-solver-adaptive.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-randiter-nonzero-prime.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-randiter-nonzero-prime.o -MD -MP -MF $depbase.Tpo -c -o test-randiter-nonzero-prime.o test-randiter-nonzero-prime.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-cra.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-cra.o -MD -MP -MF $depbase.Tpo -c -o test-cra.o test-cra.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-blas-matrix.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-blas-matrix.o -MD -MP -MF $depbase.Tpo -c -o test-blas-matrix.o test-blas-matrix.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-charpoly.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-charpoly.o -MD -MP -MF $depbase.Tpo -c -o test-charpoly.o test-charpoly.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68, from test-qlup.C:42: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-qlup.C:85:10: required from ‘bool testQLUP(const Field&, size_t, unsigned int, int, double) [with Field = Givaro::Modular; Blackbox = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; RandStream = LinBox::RandomSparseStream, std::vector, std::allocator > > >; size_t = long unsigned int]’ 85 | A.write( report,Tag::FileFormat::Maple ) << endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-qlup.C:366:46: required from here 366 | if (!testQLUP (F, n, iterations, rseed, sparsity)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-qlup.C:85:10: required from ‘bool testQLUP(const Field&, size_t, unsigned int, int, double) [with Field = Givaro::Modular; Blackbox = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; RandStream = LinBox::RandomSparseStream, std::vector, std::allocator > > >; size_t = long unsigned int]’ 85 | A.write( report,Tag::FileFormat::Maple ) << endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-qlup.C:366:46: required from here 366 | if (!testQLUP (F, n, iterations, rseed, sparsity)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-qlup.C:85:10: required from ‘bool testQLUP(const Field&, size_t, unsigned int, int, double) [with Field = Givaro::Modular; Blackbox = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; RandStream = LinBox::RandomSparseStream, std::vector, std::allocator > > >; size_t = long unsigned int]’ 85 | A.write( report,Tag::FileFormat::Maple ) << endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-qlup.C:382:46: required from here 382 | if (!testQLUP (F, n, iterations, rseed, sparsity)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-qlup.C:85:10: required from ‘bool testQLUP(const Field&, size_t, unsigned int, int, double) [with Field = Givaro::Modular; Blackbox = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; RandStream = LinBox::RandomSparseStream, std::vector, std::allocator > > >; size_t = long unsigned int]’ 85 | A.write( report,Tag::FileFormat::Maple ) << endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-qlup.C:382:46: required from here 382 | if (!testQLUP (F, n, iterations, rseed, sparsity)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ depbase=`echo test-minpoly.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-minpoly.o -MD -MP -MF $depbase.Tpo -c -o test-minpoly.o test-minpoly.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-commentator.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-commentator.o -MD -MP -MF $depbase.Tpo -c -o test-commentator.o test-commentator.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from test-rational-solver.C:34: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:157:31: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveSingular(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 157 | return monolithicSolve(num, den, A, b, m); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:47:39: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 47 | status = solveSingular(num, den, A, b, maxPrimes, level); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:171:25: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 171 | return solve(num, den, A, b, false, maxPrimes, level); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-rational-solver.C:102:41: required from ‘bool testRandomSolve(const Ring&, const Field&, LinBox::VectorStream&, LinBox::VectorStream&) [with Ring = Givaro::ZRing; Field = Givaro::Modular; Vector = LinBox::BlasVector, std::vector >]’ 102 | auto solveResult = rsolver.solve(num, den, D, b, 30); // often 5 primes are not enough | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ test-rational-solver.C:150:25: required from here 150 | if (!testRandomSolve(R, F, s1, s2)) pass = false; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ In file included from test-det.C:48: ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = Diagonal, VectorCategories::DenseVectorTag>; typename Blackbox::Field::Element = int; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = Diagonal, VectorCategories::DenseVectorTag>; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = int; class Blackbox::Field = Givaro::Modular]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-det.C:119:13: required from ‘bool testDiagonalDet1(Field&, size_t, int) [with Field = Givaro::Modular; size_t = long unsigned int]’ 119 | det (phi_wiedemann, D, WiedemannChoice); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-det.C:625:34: required from here 625 | if (!testDiagonalDet1 (F, n, iterations)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/rational-solver-adaptive.h:34, from test-rational-solver-adaptive.C:39: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:157:31: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveSingular(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 157 | return monolithicSolve(num, den, A, b, m); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:47:39: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 47 | status = solveSingular(num, den, A, b, maxPrimes, level); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector, std::vector >; InVector = LinBox::BlasVector, std::vector >; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector, std::vector >; InVector = LinBox::BlasVector, std::vector >; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ test-rational-solver-adaptive.C:121:60: required from ‘bool testRandomSolve(const Ring&, const Field&, LinBox::VectorStream&, LinBox::VectorStream&) [with Ring = Givaro::ZRing; Field = Givaro::Modular; Vector = LinBox::BlasVector, std::vector >]’ 121 | SolverReturnStatus solveResult = rsolver.solveNonsingular(num, den, D, b); //often 5 primes are not enough | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ test-rational-solver-adaptive.C:214:22: required from here 214 | if (!testRandomSolve(R, F, s1, s2)) pass = false; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26, from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/last-invariant-factor.h:30, from test-last-invariant-factor.C:39: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = std::vector; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:129:34: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor(Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector, std::vector >; _Ring = Givaro::ZRing; _Solver = LinBox::DixonSolver, Givaro::Modular, LinBox::PrimeIterator >; Integer = Givaro::Integer]’ 129 | tmp = solver.solveNonsingular(r_num, r_den, A, b); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:368:24: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor(Integer&, const IMatrix&) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _Solver = LinBox::DixonSolver, Givaro::Modular, LinBox::PrimeIterator >; Integer = Givaro::Integer]’ 368 | lastInvariantFactor (lif, A, empty_v); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ test-last-invariant-factor.C:127:28: required from ‘bool testRandom(const Ring&, LIF&, LinBox::VectorStream&) [with Ring = Givaro::ZRing; LIF = LinBox::LastInvariantFactor, LinBox::DixonSolver, Givaro::Modular, LinBox::PrimeIterator > >; Vector = LinBox::BlasVector, std::vector >]’ 127 | lif. lastInvariantFactor (x, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ test-last-invariant-factor.C:218:17: required from here 218 | if (!testRandom(R, lif, s1)) pass = false; | ~~~~~~~~~~^~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/diophantine-solver.h:29, from ../linbox/solutions/solve/solve-dixon.h:25, from test-regression2.C:35: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/solutions/solve/solve-dixon.h:119:52: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix<_Field>&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector, std::vector >; Ring = Givaro::ZRing; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer; DenseMatrix<_Field> = BlasMatrix >]’ 119 | status = dixonSolve.monolithicSolve(xNum, xDen, A, b, m); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ test-regression2.C:101:14: required from here 101 | solve(x,d,A,b,RingCategories::IntegerTag(), Method::Dixon()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:42:83: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 42 | auto nonSingularResult = (A.rowdim() == A.coldim()) ? solveNonsingular(num, den, A, b, old, maxPrimes) : SS_SINGULAR; | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:171:25: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 171 | return solve(num, den, A, b, false, maxPrimes, level); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-rational-solver.C:102:41: required from ‘bool testRandomSolve(const Ring&, const Field&, LinBox::VectorStream&, LinBox::VectorStream&) [with Ring = Givaro::ZRing; Field = Givaro::Modular; Vector = LinBox::BlasVector, std::vector >]’ 102 | auto solveResult = rsolver.solve(num, den, D, b, 30); // often 5 primes are not enough | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ test-rational-solver.C:150:25: required from here 150 | if (!testRandomSolve(R, F, s1, s2)) pass = false; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:42:83: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 42 | auto nonSingularResult = (A.rowdim() == A.coldim()) ? solveNonsingular(num, den, A, b, old, maxPrimes) : SS_SINGULAR; | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector, std::vector >; InVector = LinBox::BlasVector, std::vector >; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector, std::vector >; InVector = LinBox::BlasVector, std::vector >; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ test-rational-solver-adaptive.C:121:60: required from ‘bool testRandomSolve(const Ring&, const Field&, LinBox::VectorStream&, LinBox::VectorStream&) [with Ring = Givaro::ZRing; Field = Givaro::Modular; Vector = LinBox::BlasVector, std::vector >]’ 121 | SolverReturnStatus solveResult = rsolver.solveNonsingular(num, den, D, b); //often 5 primes are not enough | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ test-rational-solver-adaptive.C:214:22: required from here 214 | if (!testRandomSolve(R, F, s1, s2)) pass = false; | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ depbase=`echo test-isposdef.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-isposdef.o -MD -MP -MF $depbase.Tpo -c -o test-isposdef.o test-isposdef.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/algorithms/smith-form-valence.h:41, from test-smith-form-valence.C:30: ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:596:75: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 596 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:195:25: required from here 195 | PGD.prime_power_rankin( lq, lp, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:598:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 598 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:195:25: required from here 195 | PGD.prime_power_rankin( lq, lp, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:602:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 602 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:195:25: required from here 195 | PGD.prime_power_rankin( lq, lp, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:604:77: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 604 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:195:25: required from here 195 | PGD.prime_power_rankin( lq, lp, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ In file included from ../linbox/algorithms/smith-form-valence.h:221: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:253:24: required from here 253 | PGD.prime_power_rankin( effective_exponent, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:253:24: required from here 253 | PGD.prime_power_rankin( effective_exponent, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:253:24: required from here 253 | PGD.prime_power_rankin( effective_exponent, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:253:24: required from here 253 | PGD.prime_power_rankin( effective_exponent, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:596:75: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 596 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:279:24: required from here 279 | PGD.prime_power_rankin( q, p, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:598:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 598 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:279:24: required from here 279 | PGD.prime_power_rankin( q, p, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:602:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 602 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:279:24: required from here 279 | PGD.prime_power_rankin( q, p, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; _Field = Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:604:77: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; _Field = Givaro::Modular; size_t = long unsigned int]’ 604 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:279:24: required from here 279 | PGD.prime_power_rankin( q, p, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:305:24: required from here 305 | PGD.prime_power_rankin( e, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:305:24: required from here 305 | PGD.prime_power_rankin( e, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:305:24: required from here 305 | PGD.prime_power_rankin( e, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation >; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-valence.h:305:24: required from here 305 | PGD.prime_power_rankin( e, ranks, A, Q, A.rowdim(), A.coldim(), std::vector()); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparseSeq>; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::ModularBalanced]’: ../linbox/solutions/det.h:82:13: required from ‘typename Blackbox::Field::Element& LinBox::detInPlace(typename Blackbox::Field::Element&, Blackbox&, const DomainCategory&, const DetMethod&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparseSeq>; DetMethod = Method::Wiedemann; DomainCategory = RingCategories::ModularTag; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::ModularBalanced]’ 82 | return det(d, A, tag, Meth); | ~~~^~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:116:20: required from ‘typename Blackbox::Field::Element& LinBox::detInPlace(typename Blackbox::Field::Element&, Blackbox&, const MyMethod&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparseSeq>; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::ModularBalanced]’ 116 | return detInPlace(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/hybrid-det.h:114:14: required from ‘LinBox::IterationResult LinBox::IntegerModularDetReduced::operator()(typename Field::Element&, const Field&) [with Field = Givaro::ModularBalanced; Blackbox = LinBox::SparseMatrix >; MyMethod = LinBox::Method::Wiedemann; typename Field::Element = double]’ 114 | detInPlace( d, Ap, M); | ~~~~~~~~~~^~~~~~~~~~~ ../linbox/algorithms/hybrid-det.h:200:13: required from ‘typename Blackbox::Field::Element& LinBox::lif_cra_det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::IntegerTag&, const MyMethod&) [with Blackbox = SparseMatrix >; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = Givaro::Integer; class Blackbox::Field = Givaro::ZRing]’ 200 | iteration(r, D); | ~~~~~~~~~^~~~~~ ../linbox/solutions/det.h:620:26: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::IntegerTag&, const MyMethod&) [with Blackbox = SparseMatrix >; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = Givaro::Integer; class Blackbox::Field = Givaro::ZRing]’ 620 | return SOLUTION_CRA_DET(d, A, tag, Meth); | ^ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = SparseMatrix >; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = Givaro::Integer; class Blackbox::Field = Givaro::ZRing]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-det.C:368:13: required from here 368 | det (det_A_wiedemann, A, WiedemannChoice); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/solutions/solve/solve-dixon.h:106:49: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix<_Field>&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector, std::vector >; Ring = Givaro::ZRing; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer; DenseMatrix<_Field> = BlasMatrix >]’ 106 | status = dixonSolve.solveNonsingular(xNum, xDen, A, b, false, maxTrials); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression2.C:101:14: required from here 101 | solve(x,d,A,b,RingCategories::IntegerTag(), Method::Dixon()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = BlasMatrix, std::vector >; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:193:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = BlasMatrix, std::vector >; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’ 193 | return det(d, A, tag, Method::Wiedemann(Meth)); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/det-rational.h:103:8: required from ‘LinBox::IterationResult LinBox::MyRationalModularDet::operator()(Int&, const Field&) const [with Int = double; Field = Givaro::Modular; Blackbox = LinBox::BlasMatrix, std::vector > >; MyMethod = LinBox::Method::Blackbox]’ 103 | det (P, Ap, typename FieldTraits::categoryTag(), M); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/cra-domain-sequential.h:186:19: required from ‘bool LinBox::ChineseRemainderSequential::operator()(int, ResultType&, Function&, PrimeIterator&) [with ResultType = Givaro::Integer; Function = LinBox::MyRationalModularDet, std::vector > >, LinBox::Method::Blackbox>; PrimeIterator = LinBox::PrimeIterator; CRABase = LinBox::CRABuilderVarPrecEarlySingle >]’ 186 | if (Iteration(r,D) == IterationResult::SKIP) { | ~~~~~~~~~^~~~~ ../linbox/algorithms/det-rational.h:212:15: required from ‘typename Rationals::Element& LinBox::rational_det(typename Rationals::Element&, const BlasMatrix<_Field>&, const MyMethod&) [with Rationals = Givaro::QField; MyMethod = Method::Blackbox; typename Rationals::Element = Givaro::Rational; typename Vector::Dense = std::vector >]’ 212 | term |= cra((int)k,dd,iteration1,genprime); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:660:15: required from ‘typename Field::Element& LinBox::det(typename Field::Element&, const BlasMatrix<_Field>&, const RingCategories::RationalTag&, const MyMethod&) [with Field = Givaro::QField; MyMethod = Method::Blackbox; typename Field::Element = Givaro::Rational; typename Vector::Dense = std::vector >]’ 660 | rational_det(d,A,Meth); | ~~~~~~~~~~~~^~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = BlasMatrix, std::vector > >; MyMethod = Method::Blackbox; typename Blackbox::Field::Element = Givaro::Rational; class Blackbox::Field = Givaro::QField]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-det.C:573:13: required from here 573 | det (det_B_B, BB, Method::Blackbox()); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26, from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/hybrid-det.h:35, from ../linbox/solutions/det.h:600: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::SparseMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::ModularBalanced, LinBox::SparseMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::ModularBalanced, LinBox::SparseMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::SparseMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::ModularBalanced; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:293:33: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor1(Integer&, Vector&, const IMatrix&, bool) [with IMatrix = LinBox::SparseMatrix >; Vector = LinBox::BlasVector, std::vector >; _Ring = Givaro::ZRing; _Solver = LinBox::DixonSolver, Givaro::ModularBalanced, LinBox::PrimeIterator, LinBox::Method::DenseElimination>; Integer = Givaro::Integer]’ 293 | tmp = solver.solveNonsingular(r_num, r_den, A, b,oldMatrix); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/hybrid-det.h:267:31: required from ‘typename Blackbox::Field::Element& LinBox::lif_cra_det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::IntegerTag&, const MyMethod&) [with Blackbox = SparseMatrix >; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = Givaro::Integer; class Blackbox::Field = Givaro::ZRing]’ 267 | if (LIF.lastInvariantFactor1(lif, r_num1, A)==0) { | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:620:26: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::IntegerTag&, const MyMethod&) [with Blackbox = SparseMatrix >; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = Givaro::Integer; class Blackbox::Field = Givaro::ZRing]’ 620 | return SOLUTION_CRA_DET(d, A, tag, Meth); | ^ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = SparseMatrix >; MyMethod = Method::Wiedemann; typename Blackbox::Field::Element = Givaro::Integer; class Blackbox::Field = Givaro::ZRing]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-det.C:368:13: required from here 368 | det (det_A_wiedemann, A, WiedemannChoice); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68, from test-regression.C:32: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::QField; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-regression.C:326:29: required from here 326 | if (writing) A.write(std::cerr << "A:=", LinBox::Tag::FileFormat::Maple) << ';' << std::endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::QField; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-regression.C:326:29: required from here 326 | if (writing) A.write(std::cerr << "A:=", LinBox::Tag::FileFormat::Maple) << ';' << std::endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-regression.C:394:29: required from here 394 | if (writing) A.write(std::cerr << "A:=", LinBox::Tag::FileFormat::Maple) << ';' << std::endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-regression.C:394:29: required from here 394 | if (writing) A.write(std::cerr << "A:=", LinBox::Tag::FileFormat::Maple) << ';' << std::endl; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/diophantine-solver.h:29, from ../linbox/solutions/./solve/solve-dixon.h:25, from ../linbox/solutions/solve.h:339, from test-solve-full.C:24: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/solutions/./solve/solve-dixon.h:119:52: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector >; Ring = Givaro::ZRing; Vector = BlasVector >; typename IntVector::Element = Givaro::Integer; DenseMatrix = BlasMatrix >]’ 119 | status = dixonSolve.monolithicSolve(xNum, xDen, A, b, m); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:171:14: required from ‘typename std::enable_if<(std::is_same::value && std::is_same::categoryTag, LinBox::RingCategories::RationalTag>::value), RatVector&>::type LinBox::solve(RatVector&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const SolveMethod&) [with RatVector = BlasVector, std::vector > >; Matrix = BlasMatrix >; Vector = BlasVector >; SolveMethod = Method::Dixon; typename std::enable_if<(std::is_same::value && std::is_same::categoryTag, RingCategories::RationalTag>::value), RatVector&>::type = BlasVector, std::vector > >&; typename SolveMethod::CategoryTag = RingCategories::IntegerTag; typename FieldTraits::categoryTag = RingCategories::RationalTag; typename Blackbox::Field = Givaro::QField]’ 171 | solve(xNum, xDen, A, b, tag, m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-auto.h:75:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Auto&) [with ResultVector = BlasVector, std::vector > >; Matrix = BlasMatrix >; Vector = BlasVector >]’ 75 | return solve(x, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:132:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const SolveMethod&) [with ResultVector = BlasVector, std::vector > >; Matrix = BlasMatrix >; Vector = BlasVector >; SolveMethod = Method::Auto]’ 132 | return solve(x, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve-full.C:146:14: required from ‘bool test_solve(const SolveMethod&, Matrix&, Vector&, ResultDomain&, bool) [with SolveMethod = LinBox::Method::Auto; Matrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; ResultDomain = Givaro::QField]’ 146 | solve(x, A, b, method); | ~~~~~^~~~~~~~~~~~~~~~~ test-solve-full.C:171:22: required from ‘bool test_dense_solve(const SolveMethod&, Domain&, ResultDomain&, int, int, int, int, int, bool) [with SolveMethod = LinBox::Method::Auto; Domain = Givaro::ZRing; ResultDomain = Givaro::QField]’ 171 | return test_solve(method, A, b, RD, verbose); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve-full.C:269:36: required from here 269 | ok = ok && test_dense_solve(Method::Auto(method), ZZ, QQ, m, n, bitSize, vectorBitSize, seed, verbose); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:293:33: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor1(Integer&, Vector&, const IMatrix&, bool) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector, std::vector >; _Ring = Givaro::ZRing; _Solver = LinBox::DixonSolver, Givaro::Modular, LinBox::PrimeIterator, LinBox::Method::DenseElimination>; Integer = Givaro::Integer]’ 293 | tmp = solver.solveNonsingular(r_num, r_den, A, b,oldMatrix); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/det-rational.h:251:32: required from ‘typename Rationals::Element& LinBox::rational_det(typename Rationals::Element&, const BlasMatrix<_Field>&, const MyMethod&) [with Rationals = Givaro::QField; MyMethod = Method::Auto; typename Rationals::Element = Givaro::Rational; typename Vector::Dense = std::vector >]’ 251 | if (LIF.lastInvariantFactor1(lif, r_num2, Atilde)==0) { | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:660:15: required from ‘typename Field::Element& LinBox::det(typename Field::Element&, const BlasMatrix<_Field>&, const RingCategories::RationalTag&, const MyMethod&) [with Field = Givaro::QField; MyMethod = Method::Auto; typename Field::Element = Givaro::Rational; typename Vector::Dense = std::vector >]’ 660 | rational_det(d,A,Meth); | ~~~~~~~~~~~~^~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = BlasMatrix, std::vector > >; MyMethod = Method::Auto; typename Blackbox::Field::Element = Givaro::Rational; class Blackbox::Field = Givaro::QField]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-det.C:566:13: required from here 566 | det (det_B_H, BB, Method::Auto()); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from test-regression.C:44: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::__cxx11::list; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:500:8: required from here 500 | PGD(local, A, Q, 5, PRESERVE_UPPER_MATRIX|PRIVILEGIATE_NO_COLUMN_PIVOTING); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::__cxx11::list; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:500:8: required from here 500 | PGD(local, A, Q, 5, PRESERVE_UPPER_MATRIX|PRIVILEGIATE_NO_COLUMN_PIVOTING); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::__cxx11::list; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:500:8: required from here 500 | PGD(local, A, Q, 5, PRESERVE_UPPER_MATRIX|PRIVILEGIATE_NO_COLUMN_PIVOTING); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::__cxx11::list; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::__cxx11::list; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:500:8: required from here 500 | PGD(local, A, Q, 5, PRESERVE_UPPER_MATRIX|PRIVILEGIATE_NO_COLUMN_PIVOTING); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-regression.C:517:16: required from here 517 | A.write(std::clog << ", A:=", LinBox::Tag::FileFormat::Maple) << ';'; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-regression.C:517:16: required from here 517 | A.write(std::clog << ", A:=", LinBox::Tag::FileFormat::Maple) << ';'; | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/diophantine-solver.h:29, from ../linbox/solutions/./solve/solve-dixon.h:25, from ../linbox/solutions/solve.h:339, from test-regression.C:36: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/solutions/./solve/solve-dixon.h:119:52: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector >; Ring = Givaro::ZRing; Vector = BlasVector >; typename IntVector::Element = Givaro::Integer; DenseMatrix = BlasMatrix >]’ 119 | status = dixonSolve.monolithicSolve(xNum, xDen, A, b, m); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = BlasMatrix >; Vector = BlasVector >; SolveMethod = Method::Dixon; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:566:10: required from here 566 | solve(x, d, A, b, Method::Dixon(SingularSolutionType::Deterministic) ); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ In file included from ../linbox/solutions/charpoly.h:34, from test-regression.C:37: ../linbox/algorithms/bbcharpoly.h: In instantiation of ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::ModularTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix >; Polynomial = LinBox::DensePolynomial >]’: ../linbox/solutions/charpoly.h:330:39: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = SparseMatrix >; Polynomial = DensePolynomial >]’ 330 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ test-regression.C:585:13: required from ‘bool testZeroMatrixCharPoly(const CMethod&) [with CMethod = LinBox::Method::Blackbox]’ 585 | charpoly(c_A, A, RingCategories::ModularTag(), cMeth ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:679:37: required from here 679 | pass &= testZeroMatrixCharPoly<>(); | ~~~~~~~~~~~~~~~~~~~~~~~~^~ ../linbox/algorithms/bbcharpoly.h:325:20: warning: variable ‘factnum’ set but not used [-Wunused-but-set-variable=] 325 | size_t factnum = factors.size(); | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:106:49: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector >; Ring = Givaro::ZRing; Vector = BlasVector >; typename IntVector::Element = Givaro::Integer; DenseMatrix = BlasMatrix >]’ 106 | status = dixonSolve.solveNonsingular(xNum, xDen, A, b, false, maxTrials); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:171:14: required from ‘typename std::enable_if<(std::is_same::value && std::is_same::categoryTag, LinBox::RingCategories::RationalTag>::value), RatVector&>::type LinBox::solve(RatVector&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const SolveMethod&) [with RatVector = BlasVector, std::vector > >; Matrix = BlasMatrix >; Vector = BlasVector >; SolveMethod = Method::Dixon; typename std::enable_if<(std::is_same::value && std::is_same::categoryTag, RingCategories::RationalTag>::value), RatVector&>::type = BlasVector, std::vector > >&; typename SolveMethod::CategoryTag = RingCategories::IntegerTag; typename FieldTraits::categoryTag = RingCategories::RationalTag; typename Blackbox::Field = Givaro::QField]’ 171 | solve(xNum, xDen, A, b, tag, m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-auto.h:75:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Auto&) [with ResultVector = BlasVector, std::vector > >; Matrix = BlasMatrix >; Vector = BlasVector >]’ 75 | return solve(x, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:132:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const SolveMethod&) [with ResultVector = BlasVector, std::vector > >; Matrix = BlasMatrix >; Vector = BlasVector >; SolveMethod = Method::Auto]’ 132 | return solve(x, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve-full.C:146:14: required from ‘bool test_solve(const SolveMethod&, Matrix&, Vector&, ResultDomain&, bool) [with SolveMethod = LinBox::Method::Auto; Matrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; ResultDomain = Givaro::QField]’ 146 | solve(x, A, b, method); | ~~~~~^~~~~~~~~~~~~~~~~ test-solve-full.C:171:22: required from ‘bool test_dense_solve(const SolveMethod&, Domain&, ResultDomain&, int, int, int, int, int, bool) [with SolveMethod = LinBox::Method::Auto; Domain = Givaro::ZRing; ResultDomain = Givaro::QField]’ 171 | return test_solve(method, A, b, RD, verbose); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve-full.C:269:36: required from here 269 | ok = ok && test_dense_solve(Method::Auto(method), ZZ, QQ, m, n, bitSize, vectorBitSize, seed, verbose); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/rational-solver-adaptive.h:34, from ../linbox/algorithms/smith-form-adaptive.inl:41, from ../linbox/algorithms/smith-form-adaptive.h:106, from test-smith-form-adaptive.C:42: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:157:31: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveSingular(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 157 | return monolithicSolve(num, den, A, b, m); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:47:39: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 47 | status = solveSingular(num, den, A, b, maxPrimes, level); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:42:83: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 42 | auto nonSingularResult = (A.rowdim() == A.coldim()) ? solveNonsingular(num, den, A, b, old, maxPrimes) : SS_SINGULAR; | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/rational-solver-adaptive.h:34, from ../linbox/algorithms/smith-form-adaptive.inl:41, from ../linbox/algorithms/smith-form-adaptive.h:106, from ../linbox/solutions/smith-form.h:34, from test-smith-form.C:34: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:157:31: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveSingular(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 157 | return monolithicSolve(num, den, A, b, m); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:47:39: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 47 | status = solveSingular(num, den, A, b, maxPrimes, level); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:42:83: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 42 | auto nonSingularResult = (A.rowdim() == A.coldim()) ? solveNonsingular(num, den, A, b, old, maxPrimes) : SS_SINGULAR; | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from test-local-smith-form-sparseelim.C:47: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = Givaro::Integer; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ In file included from test-local-smith-form-sparseelim.C:46: ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:596:75: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 596 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = Givaro::Integer; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:598:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 598 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = Givaro::Integer; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:602:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 602 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = Givaro::Integer; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:604:77: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = Givaro::Integer; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 604 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = Givaro::Integer; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = Givaro::Integer; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = Givaro::Integer; Compute = Givaro::Integer; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:302:41: required from here 302 | pass0 &= test_sparse_local_smith(rseed,r,m,n,Givaro::Integer(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = long unsigned int; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = long unsigned int; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:596:75: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 596 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = long unsigned int; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:598:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 598 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = long unsigned int; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:602:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 602 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = long unsigned int; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:604:77: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = long unsigned int; BB = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = const Givaro::Modular; size_t = long unsigned int]’ 604 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = long unsigned int; Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = long unsigned int; SparseMat = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = long unsigned int; Compute = long unsigned int; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:305:41: required from here 305 | pass0 &= test_sparse_local_smith(rseed,r,m,n,uint64_t(2),e,d); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/bbcharpoly.h: In instantiation of ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::BlasMatrix >; Polynomial = LinBox::DensePolynomial >]’: ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-regression.C:429:13: required from here 429 | charpoly(P,A); | ~~~~~~~~^~~~~ ../linbox/algorithms/bbcharpoly.h:207:32: warning: variable ‘factnum’ set but not used [-Wunused-but-set-variable=] 207 | size_t factnum = intFactors.size(); | ^~~~~~~ depbase=`echo test-ispossemidef.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-ispossemidef.o -MD -MP -MF $depbase.Tpo -c -o test-ispossemidef.o test-ispossemidef.C &&\ mv -f $depbase.Tpo $depbase.Po ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<7>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:596:75: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’ 596 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<7>; Matrix = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<7>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:598:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’ 598 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<7>; Matrix = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<7>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:106:49: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector >; Ring = Givaro::ZRing; Vector = BlasVector >; typename IntVector::Element = Givaro::Integer; DenseMatrix = BlasMatrix >]’ 106 | status = dixonSolve.solveNonsingular(xNum, xDen, A, b, false, maxTrials); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = BlasMatrix >; Vector = BlasVector >; SolveMethod = Method::Dixon; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:566:10: required from here 566 | solve(x, d, A, b, Method::Dixon(SingularSolutionType::Deterministic) ); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:602:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’ 602 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<7>; Matrix = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<7>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:604:77: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<7>; BB = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<7>, void>; size_t = long unsigned int]’ 604 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<7>; Matrix = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<7>, void>, LinBox::BlasMatrix, RecInt::ruint<7>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<7>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<7>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<7>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<6>; Compute = RecInt::ruint<7>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 6; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:308:31: required from here 308 | pass0 &= ruint_test<6>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<8>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:596:75: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’ 596 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<8>; Matrix = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<8>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:598:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’ 598 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<8>; Matrix = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<8>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:602:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’ 602 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<8>; Matrix = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<8>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:604:77: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<8>; BB = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<8>, void>; size_t = long unsigned int]’ 604 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<8>; Matrix = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<8>, void>, LinBox::BlasMatrix, RecInt::ruint<8>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<8>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<8>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<8>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<7>; Compute = RecInt::ruint<8>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 7; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:310:31: required from here 310 | pass0 &= ruint_test<7>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68, from test-solve.C:44: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::Modular; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss-solve.inl:70:15: required from ‘Vector1& LinBox::GaussDomain<_Field>::solveInPlace(Vector1&, _Matrix&, const Vector2&) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; _Field = Givaro::Modular]’ 70 | this->QLUPin(Rank, Det, Q, L, A, P, A.rowdim(), A.coldim() ); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:77:33: required from ‘Vector& LinBox::solveInPlace(Vector&, SparseMatrix&, const Vector&, const RingCategories::ModularTag&, const Method::SparseElimination&) [with MatrixArgs = {Givaro::Modular, SparseMatrixFormat::SparseSeq}; Vector = BlasVector >]’ 77 | gaussDomain.solveInPlace(x, A, b); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:47:28: required from ‘Vector& LinBox::solve(Vector&, const Matrix&, const Vector&, const RingCategories::ModularTag&, const Method::SparseElimination&) [with Matrix = DirectSum >, ScalarMatrix > >; Vector = BlasVector >]’ 47 | return solveInPlace(x, ASparse, b, tag, m); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:132:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const SolveMethod&) [with ResultVector = BlasVector >; Matrix = DirectSum >, ScalarMatrix > >; Vector = BlasVector >; SolveMethod = Method::SparseElimination]’ 132 | return solve(x, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve.C:765:7: required from ‘bool testBasicMethodsSolve(const Field&, size_t) [with Field = Givaro::Modular; size_t = long unsigned int]’ 765 | solve(xs, A, b, Method::SparseElimination()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve.C:873:34: required from here 873 | if ( ! testBasicMethodsSolve (F, n) ) | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::Modular; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss-solve.inl:70:15: required from ‘Vector1& LinBox::GaussDomain<_Field>::solveInPlace(Vector1&, _Matrix&, const Vector2&) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; _Field = Givaro::Modular]’ 70 | this->QLUPin(Rank, Det, Q, L, A, P, A.rowdim(), A.coldim() ); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:77:33: required from ‘Vector& LinBox::solveInPlace(Vector&, SparseMatrix&, const Vector&, const RingCategories::ModularTag&, const Method::SparseElimination&) [with MatrixArgs = {Givaro::Modular, SparseMatrixFormat::SparseSeq}; Vector = BlasVector >]’ 77 | gaussDomain.solveInPlace(x, A, b); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:47:28: required from ‘Vector& LinBox::solve(Vector&, const Matrix&, const Vector&, const RingCategories::ModularTag&, const Method::SparseElimination&) [with Matrix = DirectSum >, ScalarMatrix > >; Vector = BlasVector >]’ 47 | return solveInPlace(x, ASparse, b, tag, m); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:132:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const SolveMethod&) [with ResultVector = BlasVector >; Matrix = DirectSum >, ScalarMatrix > >; Vector = BlasVector >; SolveMethod = Method::SparseElimination]’ 132 | return solve(x, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve.C:765:7: required from ‘bool testBasicMethodsSolve(const Field&, size_t) [with Field = Givaro::Modular; size_t = long unsigned int]’ 765 | solve(xs, A, b, Method::SparseElimination()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-solve.C:873:34: required from here 873 | if ( ! testBasicMethodsSolve (F, n) ) | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:537:64: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 537 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:539:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 539 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:543:65: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 543 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h: In instantiation of ‘void LinBox::PowerGaussDomainPowerOfTwo::gauss_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:545:66: required from ‘void LinBox::PowerGaussDomainPowerOfTwo::prime_power_rankin(size_t, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with BB = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 545 | gauss_rankin(EXPONENT,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:554:31: required from ‘Container, Alloc > >& LinBox::PowerGaussDomainPowerOfTwo::operator()(Container, Alloc > >&, Matrix&, Perm&, size_t, int) [with Matrix = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation; Container = std::vector; Alloc = std::allocator; UnsignedIntType = RecInt::ruint<9>; size_t = long unsigned int]’ 554 | prime_power_rankin( EXPONENT, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(),StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:137:8: required from ‘bool sparse_local_smith_poweroftwo(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix >, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 137 | PGD(local, B, Q, exp, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:246:45: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 246 | return sparse_local_smith_poweroftwo(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-poweroftwo.h:399:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 399 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:596:75: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’ 596 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<9>; Matrix = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<9>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = true; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:598:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’ 598 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<9>; Matrix = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<9>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/rational-solver-adaptive.h:34, from ../linbox/algorithms/smith-form-adaptive.inl:41, from ../linbox/algorithms/smith-form-adaptive.h:106, from ../linbox/solutions/smith-form.h:34, from test-smith-form-valence.C:29: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:157:31: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveSingular(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 157 | return monolithicSolve(num, den, A, b, m); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:47:39: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 47 | status = solveSingular(num, den, A, b, maxPrimes, level); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = true; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:602:76: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’ 602 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<9>; Matrix = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<9>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ depbase=`echo test-givaropoly.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-givaropoly.o -MD -MP -MF $depbase.Tpo -c -o test-givaropoly.o test-givaropoly.C &&\ mv -f $depbase.Tpo $depbase.Po ../linbox/algorithms/smith-form-sparseelim-local.h: In instantiation of ‘void LinBox::PowerGaussDomain<_Field>::gauss_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; bool PrivilegiateNoColumnPivoting = false; bool PreserveUpperMatrix = false; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’: ../linbox/algorithms/smith-form-sparseelim-local.h:604:77: required from ‘void LinBox::PowerGaussDomain<_Field>::prime_power_rankin(Modulo, Modulo, Container&, BB&, Perm&, size_t, size_t, const D&, int) [with Modulo = RecInt::ruint<9>; BB = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; D = std::vector; Container = std::vector; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; _Field = const Givaro::Modular, RecInt::ruint<9>, void>; size_t = long unsigned int]’ 604 | gauss_rankin(FMOD,PRIME,ranks, SLA, Q, Ni, Nj, density_trait); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:614:35: required from ‘Container, Alloc > >& LinBox::PowerGaussDomain<_Field>::operator()(Container, Alloc > >&, Matrix&, Perm&, Modulo, Modulo, int) [with Modulo = RecInt::ruint<9>; Matrix = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, RecInt::ruint<9>, void>, LinBox::BlasMatrix, RecInt::ruint<9>, void>, std::vector, std::allocator > > > >; Container = std::vector; Alloc = std::allocator; _Field = const Givaro::Modular, RecInt::ruint<9>, void>]’ 614 | prime_power_rankin( FMOD, PRIME, ranks, A, Q, A.rowdim(), A.coldim(), std::vector(), StaticParameters); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:101:8: required from ‘bool sparse_local_smith(SparseMat&, size_t, size_t, size_t, const Base&, int, const std::map&) [with Base = RecInt::ruint<9>; SparseMat = LinBox::SparseMatrix, RecInt::ruint<9>, void>, LinBox::SparseMatrixFormat::SparseSeq>; size_t = long unsigned int]’ 101 | PGD(local, B, Q, Givaro::power(p,exp), p, PRESERVE_UPPER_MATRIX); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:252:34: required from ‘bool test_sparse_local_smith(size_t, size_t, size_t, size_t, const Base&, int, double) [with Base = RecInt::ruint<8>; Compute = RecInt::ruint<9>; size_t = long unsigned int]’ 252 | return sparse_local_smith(B,R,M,N,Compute(p),exp,map_values); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:263:72: required from ‘bool ruint_test(size_t, size_t, size_t, size_t, const LinBox::Integer&, int, double) [with long unsigned int K = 8; size_t = long unsigned int; LinBox::Integer = Givaro::Integer]’ 263 | return test_sparse_local_smith,RecInt::ruint>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 264 | seed,R,M,N,RecInt::ruint(q),ne,density); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-local-smith-form-sparseelim.C:312:31: required from here 312 | pass0 &= ruint_test<8>(rseed,r,m,n,2,e,d); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-sparseelim-local.h:471:24: warning: variable ‘ind_pow’ set but not used [-Wunused-but-set-variable=] 471 | size_t ind_pow = 1; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:42:83: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 42 | auto nonSingularResult = (A.rowdim() == A.coldim()) ? solveNonsingular(num, den, A, b, old, maxPrimes) : SS_SINGULAR; | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix<_Field>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from ../linbox/algorithms/coppersmith.h:38, from ../linbox/solutions/./solve/solve-wiedemann.h:26, from ../linbox/solutions/solve.h:345: ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = Sum >, ScalarMatrix > >; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:193:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = Sum >, ScalarMatrix > >; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’ 193 | return det(d, A, tag, Method::Wiedemann(Meth)); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = Sum >, ScalarMatrix > >; MyMethod = Method::Blackbox; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:572:10: required from ‘static void LinBox::BBcharpoly::findMultiplicities(const BlackBox&, std::multimap*>&, std::multimap*, bool>&, int, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix >; FieldPoly = LinBox::DensePolynomial >; IntPoly = LinBox::DensePolynomial >]’ 572 | det (d, Agamma, M); | ~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:391:32: required from ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::ModularTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix >; Polynomial = LinBox::DensePolynomial >]’ 391 | findMultiplicities ( A, factCharPoly, leadingBlocks, goal, M); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:330:39: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = SparseMatrix >; Polynomial = DensePolynomial >]’ 330 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ test-regression.C:585:13: required from ‘bool testZeroMatrixCharPoly(const CMethod&) [with CMethod = LinBox::Method::Blackbox]’ 585 | charpoly(c_A, A, RingCategories::ModularTag(), cMeth ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:679:37: required from here 679 | pass &= testZeroMatrixCharPoly<>(); | ~~~~~~~~~~~~~~~~~~~~~~~~^~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::SparseMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector >; _LiftingContainer = LinBox::SparseLULiftingContainer, Givaro::Modular, LinBox::SparseMatrix >, LinBox::SparseMatrix > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector >; _LiftingContainer = LinBox::SparseLULiftingContainer, Givaro::Modular, LinBox::SparseMatrix >, LinBox::SparseMatrix > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/rational-solver.inl:628:22: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int) const [with IMatrix = LinBox::SparseMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 628 | if (!re.getRational(num, den, 0)) | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:156:53: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const SparseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector >; MatrixArgs = {Givaro::ZRing, SparseMatrixFormat::SparseSeq}; Vector = BlasVector >; typename IntVector::Element = Givaro::Integer]’ 156 | SolverReturnStatus status = dixonSolve.solve(xNum, xDen, A, b, maxTrials); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:229:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector >; SolveMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 229 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector >; SolveMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:152:11: required from ‘bool testFlatDixonSolver(const SolveMethod&) [with SolveMethod = LinBox::Method::SparseElimination]’ 152 | solve (A, D, M, B, m); | ~~~~~~^~~~~~~~~~~~~~~ test-regression.C:654:33: required from here 654 | pass &= testFlatDixonSolver (Method::SparseElimination()); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:157:31: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveSingular(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 157 | return monolithicSolve(num, den, A, b, m); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:47:39: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 47 | status = solveSingular(num, den, A, b, maxPrimes, level); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix::Dense>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix::Dense>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ depbase=`echo test-gf2.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-gf2.o -MD -MP -MF $depbase.Tpo -c -o test-gf2.o test-gf2.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/rational-solver-adaptive.h:34, from ../linbox/algorithms/smith-form-adaptive.inl:41, from ../linbox/algorithms/smith-form-adaptive.h:106, from ../linbox/solutions/smith-form.h:34, from ../linbox/algorithms/smith-form-sparseelim-local.h:31: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:157:31: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveSingular(Vector1&, Integer&, const IMatrix&, const Vector2&, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 157 | return monolithicSolve(num, den, A, b, m); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:47:39: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 47 | status = solveSingular(num, den, A, b, maxPrimes, level); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix::Dense>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix::Dense>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ depbase=`echo test-givaro-zpz.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-givaro-zpz.o -MD -MP -MF $depbase.Tpo -c -o test-givaro-zpz.o test-givaro-zpz.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-givaro-zpzuns.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-givaro-zpzuns.o -MD -MP -MF $depbase.Tpo -c -o test-givaro-zpzuns.o test-givaro-zpzuns.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-givaro-interfaces.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-givaro-interfaces.o -MD -MP -MF $depbase.Tpo -c -o test-givaro-interfaces.o test-givaro-interfaces.C &&\ mv -f $depbase.Tpo $depbase.Po ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = Sum, std::vector >, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:193:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = Sum, std::vector >, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 193 | return det(d, A, tag, Method::Wiedemann(Meth)); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = Sum, std::vector >, ScalarMatrix > >; MyMethod = Method::Blackbox; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:572:10: required from ‘static void LinBox::BBcharpoly::findMultiplicities(const BlackBox&, std::multimap*>&, std::multimap*, bool>&, int, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::BlasMatrix, std::vector >; FieldPoly = LinBox::DensePolynomial >; IntPoly = LinBox::DensePolynomial >]’ 572 | det (d, Agamma, M); | ~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:262:23: required from ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::BlasMatrix >; Polynomial = LinBox::DensePolynomial >]’ 262 | findMultiplicities (Ap, factCharPoly, leadingBlocks, goal, M); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-regression.C:429:13: required from here 429 | charpoly(P,A); | ~~~~~~~~^~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix >; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::Modular; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver.inl:593:12: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int) const [with IMatrix = LinBox::SparseMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 593 | GD.QLUPin(rank,det,Q,L,Ap,P,Ap.rowdim(), Ap.coldim()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:156:53: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const SparseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector >; MatrixArgs = {Givaro::ZRing, SparseMatrixFormat::SparseSeq}; Vector = BlasVector >; typename IntVector::Element = Givaro::Integer]’ 156 | SolverReturnStatus status = dixonSolve.solve(xNum, xDen, A, b, maxTrials); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:229:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector >; SolveMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 229 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector >; SolveMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:152:11: required from ‘bool testFlatDixonSolver(const SolveMethod&) [with SolveMethod = LinBox::Method::SparseElimination]’ 152 | solve (A, D, M, B, m); | ~~~~~~^~~~~~~~~~~~~~~ test-regression.C:654:33: required from here 654 | pass &= testFlatDixonSolver (Method::SparseElimination()); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix >; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::Modular; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver.inl:593:12: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int) const [with IMatrix = LinBox::SparseMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 593 | GD.QLUPin(rank,det,Q,L,Ap,P,Ap.rowdim(), Ap.coldim()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:156:53: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const SparseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector >; MatrixArgs = {Givaro::ZRing, SparseMatrixFormat::SparseSeq}; Vector = BlasVector >; typename IntVector::Element = Givaro::Integer]’ 156 | SolverReturnStatus status = dixonSolve.solve(xNum, xDen, A, b, maxTrials); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:229:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector >; SolveMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 229 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector >; SolveMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:152:11: required from ‘bool testFlatDixonSolver(const SolveMethod&) [with SolveMethod = LinBox::Method::SparseElimination]’ 152 | solve (A, D, M, B, m); | ~~~~~~^~~~~~~~~~~~~~~ test-regression.C:654:33: required from here 654 | pass &= testFlatDixonSolver (Method::SparseElimination()); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:42:83: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int, LinBox::SolverLevel) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector >; Vector2 = LinBox::BlasVector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 42 | auto nonSingularResult = (A.rowdim() == A.coldim()) ? solveNonsingular(num, den, A, b, old, maxPrimes) : SS_SINGULAR; | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:62:24: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptiveClass::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix::Dense>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 62 | ret = solver. solve(num, den, M, Ib); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver-adaptive.h:95:82: required from ‘static LinBox::SolverReturnStatus LinBox::RationalSolverAdaptive::solveNonsingular(OutVector&, typename IRing::Element&, const LinBox::BlasMatrix::Dense>&, const InVector&) [with IRing = Givaro::ZRing; OutVector = LinBox::BlasVector >; InVector = std::vector; typename IRing::Element = Givaro::Integer; typename LinBox::Vector::Dense = std::vector]’ 95 | return RationalSolverAdaptiveClass::solveNonsingular(num, den, M, b); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ ../linbox/algorithms/last-invariant-factor.h:192:36: required from ‘LinBox::LastInvariantFactor<_Ring, _Solver>::Integer& LinBox::LastInvariantFactor<_Ring, _Solver>::lastInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, const Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _Solver = LinBox::RationalSolverAdaptive; Integer = Givaro::Integer]’ 192 | tmp1 = solver. solveNonsingular(r1_num, r1_den, A, b1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:242:34: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int, Vector&) [with IMatrix = LinBox::BlasMatrix >; Vector = LinBox::BlasVector >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 242 | lif.lastInvariantFactor_Bonus(oif, bonus, A, PrimeL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/one-invariant-factor.h:285:29: required from ‘LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::Integer& LinBox::OneInvariantFactor<_Ring, _LastInvariantFactor, _Compose, _RandomMatrix>::oneInvariantFactor_Bonus(Integer&, Integer&, const IMatrix&, int) [with IMatrix = LinBox::BlasMatrix >; _Ring = Givaro::ZRing; _LastInvariantFactor = LinBox::LastInvariantFactor, LinBox::RationalSolverAdaptive>; _Compose = LinBox::SCompose; _RandomMatrix = LinBox::RandomMatrix; Integer = Givaro::Integer]’ 285 | oneInvariantFactor_Bonus (oif, bonus, A, i, empty_v); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/smith-form-adaptive.inl:550:34: required from ‘static void LinBox::SmithFormAdaptive::smithForm(LinBox::BlasVector >&, const LinBox::BlasMatrix<_Field, _Storage>&) [with IRing = Givaro::ZRing; _Rep = std::vector]’ 550 | oif. oneInvariantFactor_Bonus (_lif, _bonus, A, (int)r); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/smith-form.h:214:31: required from here 214 | SmithFormAdaptive::smithForm(v, A); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ depbase=`echo test-echelon-form.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-echelon-form.o -MD -MP -MF $depbase.Tpo -c -o test-echelon-form.o test-echelon-form.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-blas-domain-mul.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-blas-domain-mul.o -MD -MP -MF $depbase.Tpo -c -o test-blas-domain-mul.o test-blas-domain-mul.C &&\ mv -f $depbase.Tpo $depbase.Po ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ModularBalanced; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::ModularBalanced; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss-solve.inl:70:15: required from ‘Vector1& LinBox::GaussDomain<_Field>::solveInPlace(Vector1&, _Matrix&, const Vector2&) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; _Field = Givaro::ModularBalanced]’ 70 | this->QLUPin(Rank, Det, Q, L, A, P, A.rowdim(), A.coldim() ); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:77:33: required from ‘Vector& LinBox::solveInPlace(Vector&, SparseMatrix&, const Vector&, const RingCategories::ModularTag&, const Method::SparseElimination&) [with MatrixArgs = {Givaro::ModularBalanced, SparseMatrixFormat::SparseSeq}; Vector = BlasVector, std::vector >]’ 77 | gaussDomain.solveInPlace(x, A, b); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:58:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] 58 | return solveInPlace(x, ACopy, b, tag, m); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-cra.h:131:38: required from ‘LinBox::BlasVector >& LinBox::RationalChineseRemainder::operator()(LinBox::BlasVector >&, LinBox::Integer&, Function&, RandPrimeIterator&) [with Function = {anonymous}::CRASolveIteration >, LinBox::BlasVector, std::vector > >, LinBox::Method::SparseElimination>; RandPrimeIterator = LinBox::PrimeIterator; RatCRABase = LinBox::RationalCRABuilderEarlyMultip >; LinBox::Integer = Givaro::Integer]’ 131 | Builder_.initialize( D, Iteration(r, D) ); | ~~~~~~~~~^~~~~~ ../linbox/solutions/./solve/solve-cra.h:175:16: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::CRA&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector > >; IterationMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 175 | cra(num, den, iteration, primeGenerator); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-cra.h:224:14: required from ‘RatVector& LinBox::solve(RatVector&, const RatMatrix&, const RatVector&, const RingCategories::RationalTag&, const Method::CRA&) [with RatVector = BlasVector, std::vector > >; RatMatrix = SparseMatrix >; IterationMethod = Method::SparseElimination]’ 224 | solve(xNum, xDen, A, b, RingCategories::IntegerTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:150:21: required from ‘RatVector& LinBox::solve(RatVector&, const RatMatrix&, const Vector&, const RingCategories::RationalTag&, const SolveMethod&) [with RatVector = BlasVector, std::vector > >; RatMatrix = SparseMatrix >; Vector = BlasVector, std::vector > >; SolveMethod = Method::SparseElimination]’ 150 | return solve(x, A, b, tag, Method::CRA(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:132:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const SolveMethod&) [with ResultVector = BlasVector, std::vector > >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector > >; SolveMethod = Method::SparseElimination]’ 132 | return solve(x, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:318:10: required from here 318 | solve(X,A,B,Method::SparseElimination()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ModularBalanced; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::ModularBalanced; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss-solve.inl:70:15: required from ‘Vector1& LinBox::GaussDomain<_Field>::solveInPlace(Vector1&, _Matrix&, const Vector2&) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; _Field = Givaro::ModularBalanced]’ 70 | this->QLUPin(Rank, Det, Q, L, A, P, A.rowdim(), A.coldim() ); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:77:33: required from ‘Vector& LinBox::solveInPlace(Vector&, SparseMatrix&, const Vector&, const RingCategories::ModularTag&, const Method::SparseElimination&) [with MatrixArgs = {Givaro::ModularBalanced, SparseMatrixFormat::SparseSeq}; Vector = BlasVector, std::vector >]’ 77 | gaussDomain.solveInPlace(x, A, b); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ ../linbox/solutions/./solve/solve-sparse-elimination.h:58:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] 58 | return solveInPlace(x, ACopy, b, tag, m); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-cra.h:131:38: required from ‘LinBox::BlasVector >& LinBox::RationalChineseRemainder::operator()(LinBox::BlasVector >&, LinBox::Integer&, Function&, RandPrimeIterator&) [with Function = {anonymous}::CRASolveIteration >, LinBox::BlasVector, std::vector > >, LinBox::Method::SparseElimination>; RandPrimeIterator = LinBox::PrimeIterator; RatCRABase = LinBox::RationalCRABuilderEarlyMultip >; LinBox::Integer = Givaro::Integer]’ 131 | Builder_.initialize( D, Iteration(r, D) ); | ~~~~~~~~~^~~~~~ ../linbox/solutions/./solve/solve-cra.h:175:16: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::CRA&) [with IntVector = BlasVector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector > >; IterationMethod = Method::SparseElimination; typename IntVector::Element = Givaro::Integer]’ 175 | cra(num, den, iteration, primeGenerator); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-cra.h:224:14: required from ‘RatVector& LinBox::solve(RatVector&, const RatMatrix&, const RatVector&, const RingCategories::RationalTag&, const Method::CRA&) [with RatVector = BlasVector, std::vector > >; RatMatrix = SparseMatrix >; IterationMethod = Method::SparseElimination]’ 224 | solve(xNum, xDen, A, b, RingCategories::IntegerTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:150:21: required from ‘RatVector& LinBox::solve(RatVector&, const RatMatrix&, const Vector&, const RingCategories::RationalTag&, const SolveMethod&) [with RatVector = BlasVector, std::vector > >; RatMatrix = SparseMatrix >; Vector = BlasVector, std::vector > >; SolveMethod = Method::SparseElimination]’ 150 | return solve(x, A, b, tag, Method::CRA(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:132:21: required from ‘ResultVector& LinBox::solve(ResultVector&, const Matrix&, const Vector&, const SolveMethod&) [with ResultVector = BlasVector, std::vector > >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector > >; SolveMethod = Method::SparseElimination]’ 132 | return solve(x, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-regression.C:318:10: required from here 318 | solve(X,A,B,Method::SparseElimination()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ depbase=`echo test-blas-domain.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-blas-domain.o -MD -MP -MF $depbase.Tpo -c -o test-blas-domain.o test-blas-domain.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/matrix/sparsematrix/sparse-parallel-vector.h:649, from ../linbox/matrix/sparsematrix/sparse-generic.h:473, from ../linbox/matrix/sparse-matrix.h:70, from test-charpoly.C:44: ../linbox/matrix/sparsematrix/sparse-parallel-vector.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper >::writePretty(const LinBox::Protected::SparseMatrixGeneric<_Field, _Row>&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string) [with _Field = Givaro::Modular; Row = std::pair, std::vector >; std::ostream = std::basic_ostream; typename LinBox::VectorTraits::VectorCategory = LinBox::VectorCategories::SparseParallelVectorTag; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/sparse-parallel-vector.inl:165:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper >::write(const LinBox::Protected::SparseMatrixGeneric<_Field, _Row>&, std::ostream&, LinBox::Tag::FileFormat) [with _Field = Givaro::Modular; Row = std::pair, std::vector >; std::ostream = std::basic_ostream; typename LinBox::VectorTraits::VectorCategory = LinBox::VectorCategories::SparseParallelVectorTag]’ 165 | return writePretty(A,os,"[","]","","; ",",",""); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-parallel-vector.h:227:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, Row, LinBox::VectorCategories::SparseParallelVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::pair, std::vector >; std::ostream = std::basic_ostream]’ 227 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-charpoly.C:162:10: required from ‘bool testNilpotentCharpoly(Field&, size_t) [with Field = Givaro::Modular; size_t = long unsigned int]’ 162 | A.write (who, Tag::FileFormat::Maple); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:344:29: required from here 344 | if (!testNilpotentCharpoly (F, n)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/matrix/sparsematrix/sparse-parallel-vector.inl:92:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 92 | size_t i_idx, j_idx_1; | ^~~~~ In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-charpoly.C:245:10: required from ‘bool testRandomCharpoly(Field&, LinBox::VectorStream<_Vector>&, LinBox::VectorStream&) [with Field = Givaro::Modular; Row = std::vector, std::allocator > >; Vector = LinBox::BlasVector >]’ 245 | A.write (report, Tag::FileFormat::Maple); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:345:29: required from here 345 | if (!testRandomCharpoly (F, A_stream, v_stream)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-charpoly.C:245:10: required from ‘bool testRandomCharpoly(Field&, LinBox::VectorStream<_Vector>&, LinBox::VectorStream&) [with Field = Givaro::Modular; Row = std::vector, std::allocator > >; Vector = LinBox::BlasVector >]’ 245 | A.write (report, Tag::FileFormat::Maple); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:345:29: required from here 345 | if (!testRandomCharpoly (F, A_stream, v_stream)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ In file included from ../linbox/solutions/charpoly.h:34, from test-charpoly.C:46: ../linbox/algorithms/bbcharpoly.h: In instantiation of ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::ModularTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix >; Polynomial = LinBox::DensePolynomial >]’: ../linbox/solutions/charpoly.h:330:39: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = SparseMatrix >; Polynomial = DensePolynomial >]’ 330 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = SparseMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Blackbox]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:281:11: required from ‘bool testRandomCharpoly(Field&, LinBox::VectorStream<_Vector>&, LinBox::VectorStream&) [with Field = Givaro::Modular; Row = std::vector, std::allocator > >; Vector = LinBox::BlasVector >]’ 281 | charpoly (psi, A, meth ); | ~~~~~~~~~^~~~~~~~~~~~~~~ test-charpoly.C:345:29: required from here 345 | if (!testRandomCharpoly (F, A_stream, v_stream)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:325:20: warning: variable ‘factnum’ set but not used [-Wunused-but-set-variable=] 325 | size_t factnum = factors.size(); | ^~~~~~~ ../linbox/matrix/sparsematrix/sparse-parallel-vector.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper >::writePretty(const LinBox::Protected::SparseMatrixGeneric<_Field, _Row>&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string) [with _Field = Givaro::ZRing; Row = std::pair, std::vector >; std::ostream = std::basic_ostream; typename LinBox::VectorTraits::VectorCategory = LinBox::VectorCategories::SparseParallelVectorTag; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/sparse-parallel-vector.inl:165:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper >::write(const LinBox::Protected::SparseMatrixGeneric<_Field, _Row>&, std::ostream&, LinBox::Tag::FileFormat) [with _Field = Givaro::ZRing; Row = std::pair, std::vector >; std::ostream = std::basic_ostream; typename LinBox::VectorTraits::VectorCategory = LinBox::VectorCategories::SparseParallelVectorTag]’ 165 | return writePretty(A,os,"[","]","","; ",",",""); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-parallel-vector.h:227:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, Row, LinBox::VectorCategories::SparseParallelVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::pair, std::vector >; std::ostream = std::basic_ostream]’ 227 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-charpoly.C:162:10: required from ‘bool testNilpotentCharpoly(Field&, size_t) [with Field = Givaro::ZRing; size_t = long unsigned int]’ 162 | A.write (who, Tag::FileFormat::Maple); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:367:29: required from here 367 | if (!testNilpotentCharpoly (Z, n)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/matrix/sparsematrix/sparse-parallel-vector.inl:92:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 92 | size_t i_idx, j_idx_1; | ^~~~~ depbase=`echo test-hadamard-bound.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-hadamard-bound.o -MD -MP -MF $depbase.Tpo -c -o test-hadamard-bound.o test-hadamard-bound.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68, from test-isposdef.C:37: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-isposdef.C:72:10: required from ‘bool testIsPosDef(const Ring&, size_t, unsigned int, Method&, std::string, double) [with Ring = Givaro::ZRing; Method = LinBox::Method::Auto; size_t = long unsigned int; std::string = std::__cxx11::basic_string]’ 72 | A.write( report ) << std::endl; | ~~~~~~~^~~~~~~~~~ test-isposdef.C:129:30: required from here 129 | pass = pass and testIsPosDef(R, n, iterations, MH, "Method::Auto", sparsity); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-isposdef.C:72:10: required from ‘bool testIsPosDef(const Ring&, size_t, unsigned int, Method&, std::string, double) [with Ring = Givaro::ZRing; Method = LinBox::Method::Auto; size_t = long unsigned int; std::string = std::__cxx11::basic_string]’ 72 | A.write( report ) << std::endl; | ~~~~~~~^~~~~~~~~~ test-isposdef.C:129:30: required from here 129 | pass = pass and testIsPosDef(R, n, iterations, MH, "Method::Auto", sparsity); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ ../linbox/algorithms/bbcharpoly.h: In instantiation of ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::BlasMatrix >; Polynomial = LinBox::DensePolynomial >]’: ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:197:17: required from here 197 | charpoly(phi,A); | ~~~~~~~~^~~~~~~ ../linbox/algorithms/bbcharpoly.h:207:32: warning: variable ‘factnum’ set but not used [-Wunused-but-set-variable=] 207 | size_t factnum = intFactors.size(); | ^~~~~~~ depbase=`echo test-fft.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-fft.o -MD -MP -MF $depbase.Tpo -c -o test-fft.o test-fft.C &&\ mv -f $depbase.Tpo $depbase.Po ../linbox/algorithms/bbcharpoly.h: In instantiation of ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::ScalarMatrix >; Polynomial = LinBox::DensePolynomial >]’: ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:99:11: required from ‘bool testIdentityCharpoly(Dom&, size_t, bool) [with Dom = Givaro::ZRing; size_t = long unsigned int]’ 99 | charpoly (phi, A); | ~~~~~~~~~^~~~~~~~ test-charpoly.C:366:29: required from here 366 | if (!testIdentityCharpoly (Z, n)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/bbcharpoly.h:207:32: warning: variable ‘factnum’ set but not used [-Wunused-but-set-variable=] 207 | size_t factnum = intFactors.size(); | ^~~~~~~ ../linbox/algorithms/bbcharpoly.h: In instantiation of ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparsePar>; Polynomial = LinBox::DensePolynomial >]’: ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:166:11: required from ‘bool testNilpotentCharpoly(Field&, size_t) [with Field = Givaro::ZRing; size_t = long unsigned int]’ 166 | charpoly (phi, A); | ~~~~~~~~~^~~~~~~~ test-charpoly.C:367:29: required from here 367 | if (!testNilpotentCharpoly (Z, n)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/algorithms/bbcharpoly.h:207:32: warning: variable ‘factnum’ set but not used [-Wunused-but-set-variable=] 207 | size_t factnum = intFactors.size(); | ^~~~~~~ depbase=`echo test-serialization.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-serialization.o -MD -MP -MF $depbase.Tpo -c -o test-serialization.o test-serialization.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/algorithms/bbcharpoly.h:46: ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = Sum >, ScalarMatrix > >; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:193:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = Sum >, ScalarMatrix > >; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’ 193 | return det(d, A, tag, Method::Wiedemann(Meth)); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = Sum >, ScalarMatrix > >; MyMethod = Method::Blackbox; typename Blackbox::Field::Element = double; class Blackbox::Field = Givaro::Modular]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:572:10: required from ‘static void LinBox::BBcharpoly::findMultiplicities(const BlackBox&, std::multimap*>&, std::multimap*, bool>&, int, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix >; FieldPoly = LinBox::DensePolynomial >; IntPoly = LinBox::DensePolynomial >]’ 572 | det (d, Agamma, M); | ~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:391:32: required from ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::ModularTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix >; Polynomial = LinBox::DensePolynomial >]’ 391 | findMultiplicities ( A, factCharPoly, leadingBlocks, goal, M); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:330:39: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = SparseMatrix >; Polynomial = DensePolynomial >]’ 330 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = SparseMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Blackbox]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:281:11: required from ‘bool testRandomCharpoly(Field&, LinBox::VectorStream<_Vector>&, LinBox::VectorStream&) [with Field = Givaro::Modular; Row = std::vector, std::allocator > >; Vector = LinBox::BlasVector >]’ 281 | charpoly (psi, A, meth ); | ~~~~~~~~~^~~~~~~~~~~~~~~ test-charpoly.C:345:29: required from here 345 | if (!testRandomCharpoly (F, A_stream, v_stream)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = Sum, std::vector >, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:193:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = Sum, std::vector >, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 193 | return det(d, A, tag, Method::Wiedemann(Meth)); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = Sum, std::vector >, ScalarMatrix > >; MyMethod = Method::Blackbox; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:572:10: required from ‘static void LinBox::BBcharpoly::findMultiplicities(const BlackBox&, std::multimap*>&, std::multimap*, bool>&, int, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::BlasMatrix, std::vector >; FieldPoly = LinBox::DensePolynomial >; IntPoly = LinBox::DensePolynomial >]’ 572 | det (d, Agamma, M); | ~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:262:23: required from ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::BlasMatrix >; Polynomial = LinBox::DensePolynomial >]’ 262 | findMultiplicities (Ap, factCharPoly, leadingBlocks, goal, M); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = BlasMatrix >; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:197:17: required from here 197 | charpoly(phi,A); | ~~~~~~~~^~~~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ depbase=`echo test-ntl-lzz_pex.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-ntl-lzz_pex.o -MD -MP -MF $depbase.Tpo -c -o test-ntl-lzz_pex.o test-ntl-lzz_pex.C &&\ mv -f $depbase.Tpo $depbase.Po depbase=`echo test-toeplitz-det.o | sed 's|[^/]*$|.deps/&|;s|\.o$||'`;\ g++ -DHAVE_CONFIG_H -I. -I.. -I.. -DLinBoxTestOnly -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -MT test-toeplitz-det.o -MD -MP -MF $depbase.Tpo -c -o test-toeplitz-det.o test-toeplitz-det.C &&\ mv -f $depbase.Tpo $depbase.Po In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68, from test-minpoly.C:51: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::Modular; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::Modular; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:511:53: required from here 511 | pass &= run_with_field >(q,e,b,n,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::Modular; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::Modular; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:511:53: required from here 511 | pass &= run_with_field >(q,e,b,n,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68, from test-ispossemidef.C:43: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-ispossemidef.C:84:10: required from ‘bool testIsPosSemidef(const Ring&, size_t, unsigned int, Method&, double) [with Ring = Givaro::ZRing; Method = LinBox::Method::Elimination; size_t = long unsigned int]’ 84 | A.write( report ) << endl; | ~~~~~~~^~~~~~~~~~ test-ispossemidef.C:140:34: required from here 140 | pass = pass and testIsPosSemidef(R, n, iterations, ME, sparsity); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-ispossemidef.C:84:10: required from ‘bool testIsPosSemidef(const Ring&, size_t, unsigned int, Method&, double) [with Ring = Givaro::ZRing; Method = LinBox::Method::Elimination; size_t = long unsigned int]’ 84 | A.write( report ) << endl; | ~~~~~~~^~~~~~~~~~ test-ispossemidef.C:140:34: required from here 140 | pass = pass and testIsPosSemidef(R, n, iterations, ME, sparsity); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = Sum >, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:193:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = Sum >, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 193 | return det(d, A, tag, Method::Wiedemann(Meth)); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = Sum >, ScalarMatrix > >; MyMethod = Method::Blackbox; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:572:10: required from ‘static void LinBox::BBcharpoly::findMultiplicities(const BlackBox&, std::multimap*>&, std::multimap*, bool>&, int, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::ScalarMatrix >; FieldPoly = LinBox::DensePolynomial >; IntPoly = LinBox::DensePolynomial >]’ 572 | det (d, Agamma, M); | ~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:262:23: required from ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::ScalarMatrix >; Polynomial = LinBox::DensePolynomial >]’ 262 | findMultiplicities (Ap, factCharPoly, leadingBlocks, goal, M); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = ScalarMatrix >; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:99:11: required from ‘bool testIdentityCharpoly(Dom&, size_t, bool) [with Dom = Givaro::ZRing; size_t = long unsigned int]’ 99 | charpoly (phi, A); | ~~~~~~~~~^~~~~~~~ test-charpoly.C:366:29: required from here 366 | if (!testIdentityCharpoly (Z, n)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::Modular; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::Modular; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:512:54: required from here 512 | pass &= run_with_field >(q,e,b,n,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::Modular; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::Modular; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:512:54: required from here 512 | pass &= run_with_field >(q,e,b,n,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ ../linbox/solutions/det.h: In instantiation of ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Wiedemann&) [with Blackbox = Sum, SparseMatrixFormat::SparsePar>, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’: ../linbox/solutions/det.h:193:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const RingCategories::ModularTag&, const Method::Blackbox&) [with Blackbox = Sum, SparseMatrixFormat::SparsePar>, ScalarMatrix > >; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 193 | return det(d, A, tag, Method::Wiedemann(Meth)); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/det.h:107:13: required from ‘typename Blackbox::Field::Element& LinBox::det(typename Blackbox::Field::Element&, const Blackbox&, const MyMethod&) [with Blackbox = Sum, SparseMatrixFormat::SparsePar>, ScalarMatrix > >; MyMethod = Method::Blackbox; typename Blackbox::Field::Element = unsigned int; class Blackbox::Field = Givaro::Modular]’ 107 | return det(d, A, typename FieldTraits::categoryTag(), Meth); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:572:10: required from ‘static void LinBox::BBcharpoly::findMultiplicities(const BlackBox&, std::multimap*>&, std::multimap*, bool>&, int, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparsePar>; FieldPoly = LinBox::DensePolynomial >; IntPoly = LinBox::DensePolynomial >]’ 572 | det (d, Agamma, M); | ~~~~^~~~~~~~~~~~~~ ../linbox/algorithms/bbcharpoly.h:262:23: required from ‘static Polynomial& LinBox::BBcharpoly::blackboxcharpoly(Polynomial&, const BlackBox&, const LinBox::RingCategories::IntegerTag&, const LinBox::Method::Blackbox&) [with BlackBox = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparsePar>; Polynomial = LinBox::DensePolynomial >]’ 262 | findMultiplicities (Ap, factCharPoly, leadingBlocks, goal, M); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:259:45: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Blackbox&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >]’ 259 | return BBcharpoly::blackboxcharpoly (P, A, tag, M); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:197:12: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const RingCategories::IntegerTag&, const Method::Auto&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >]’ 197 | charpoly(P, A, tag, Method::Blackbox(M) ); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:75:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&, const MyMethod&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >; MyMethod = Method::Auto]’ 75 | return charpoly ( P, A, typename FieldTraits::categoryTag(), M); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/charpoly.h:84:19: required from ‘Polynomial& LinBox::charpoly(Polynomial&, const Blackbox&) [with Blackbox = SparseMatrix, SparseMatrixFormat::SparsePar>; Polynomial = DensePolynomial >]’ 84 | return charpoly (P, A, Method::Auto()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ test-charpoly.C:166:11: required from ‘bool testNilpotentCharpoly(Field&, size_t) [with Field = Givaro::ZRing; size_t = long unsigned int]’ 166 | charpoly (phi, A); | ~~~~~~~~~^~~~~~~~ test-charpoly.C:367:29: required from here 367 | if (!testNilpotentCharpoly (Z, n)) pass = false; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../linbox/solutions/det.h:227:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 227 | size_t iternum = 1; | ^~~~~~~ ../linbox/solutions/det.h:285:32: warning: variable ‘iternum’ set but not used [-Wunused-but-set-variable=] 285 | size_t iternum = 1; | ^~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::Modular; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::Modular; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:513:62: required from here 513 | pass &= run_with_field >(q,e,b?b:128,n/3+1,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::Modular; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::Modular; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:513:62: required from here 513 | pass &= run_with_field >(q,e,b?b:128,n/3+1,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::ZRing; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::ZRing; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:515:60: required from here 515 | pass &= run_with_field >(0,e,b?b:128,n/3+1,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::ZRing; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ test-minpoly.C:78:12: required from ‘bool testZeroMinpoly(Field&, size_t, const Meth&) [with Field = Givaro::ZRing; Meth = LinBox::Method::Auto; size_t = long unsigned int]’ 78 | A.write(report, Tag::FileFormat::Maple); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:439:28: required from ‘bool run_with_field(LinBox::integer, int, uint64_t, size_t, int, int, int, uint64_t) [with Field = Givaro::ZRing; LinBox::integer = Givaro::Integer; uint64_t = long unsigned int; size_t = long unsigned int]’ 439 | ok &= testZeroMinpoly (*F, n, Method::Auto()); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ test-minpoly.C:515:60: required from here 515 | pass &= run_with_field >(0,e,b?b:128,n/3+1,iterations,numVectors,k,seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 ../linbox/liblinbox.la -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o test-solve-full test-solve-full.o -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp libtool: link: g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,-z -Wl,relro -Wl,-z -Wl,now -Wl,-z -Wl,pack-relative-relocs -flto=auto -falign-functions=32 -o .libs/test-solve-full test-solve-full.o ../linbox/.libs/liblinbox.so -Wl,--as-needed -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp -pthread /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 ../linbox/liblinbox.la -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o test-smith-form test-smith-form.o -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 ../linbox/liblinbox.la -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o test-smith-form-adaptive test-smith-form-adaptive.o -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp libtool: link: g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,-z -Wl,relro -Wl,-z -Wl,now -Wl,-z -Wl,pack-relative-relocs -flto=auto -falign-functions=32 -o .libs/test-smith-form-adaptive test-smith-form-adaptive.o ../linbox/.libs/liblinbox.so -Wl,--as-needed -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp -pthread libtool: link: g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,-z -Wl,relro -Wl,-z -Wl,now -Wl,-z -Wl,pack-relative-relocs -flto=auto -falign-functions=32 -o .libs/test-smith-form test-smith-form.o ../linbox/.libs/liblinbox.so -Wl,--as-needed -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp -pthread /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 ../linbox/liblinbox.la -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o test-smith-form-iliopoulos test-smith-form-iliopoulos.o -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp libtool: link: g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,-z -Wl,relro -Wl,-z -Wl,now -Wl,-z -Wl,pack-relative-relocs -flto=auto -falign-functions=32 -o .libs/test-smith-form-iliopoulos test-smith-form-iliopoulos.o ../linbox/.libs/liblinbox.so -Wl,--as-needed -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp -pthread /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 ../linbox/liblinbox.la -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o test-smith-form-local test-smith-form-local.o -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -pthread -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 ../linbox/liblinbox.la -Wl,-O1 -Wl,--sort-common -Wl,--as-needed -Wl,-z,relro -Wl,-z,now -Wl,-z,pack-relative-relocs -flto=auto -falign-functions=32 -o test-last-invariant-factor test-last-invariant-factor.o -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp libtool: link: g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,-z -Wl,relro -Wl,-z -Wl,now -Wl,-z -Wl,pack-relative-relocs -flto=auto -falign-functions=32 -o .libs/test-last-invariant-factor test-last-invariant-factor.o ../linbox/.libs/liblinbox.so -Wl,--as-needed -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp -pthread libtool: link: g++ -O2 -Wall -DNDEBUG -UDEBUG -DFFLAS_COMPILED -DFFPACK_COMPILED -march=x86-64-v2 -O3 -pipe -fno-plt -fexceptions -Wp,-D_FORTIFY_SOURCE=3 -Wformat -Werror=format-security -fstack-clash-protection -fcf-protection -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -mpclmul -Wp,-D_GLIBCXX_ASSERTIONS -g -ffile-prefix-map=/startdir/src=/usr/src/debug/linbox -flto=auto -falign-functions=32 -Wl,-O1 -Wl,--sort-common -Wl,-z -Wl,relro -Wl,-z -Wl,now -Wl,-z -Wl,pack-relative-relocs -flto=auto -falign-functions=32 -o .libs/test-smith-form-local test-smith-form-local.o ../linbox/.libs/liblinbox.so -Wl,--as-needed -lntl -lmpfr -lfplll -liml -lflint -lfflas -lffpack -lblas -lcblas -llapack -lgivaro -lgmpxx -lgmp -pthread In file included from /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/include/immintrin.h:43, from /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/include/x86intrin.h:32, from /usr/include/fflas-ffpack/utils/fflas_intrinsic.h:34, from /usr/include/fflas-ffpack/fflas/fflas_simd.h:36, from ../linbox/algorithms/polynomial-matrix/fft.h:35, from test-fft.C:27: /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/include/avxintrin.h: In function ‘Simd128_impl::pack(float __vector(4)&, float __vector(4)&, float __vector(4), float __vector(4))’: /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/include/avxintrin.h:606:1: error: inlining failed in call to ‘always_inline’ ‘_mm_permute_ps(float __vector(4), int)’: target specific option mismatch 606 | _mm_permute_ps (__m128 __X, const int __C) | ^~~~~~~~~~~~~~ In file included from /usr/include/fflas-ffpack/fflas/fflas_simd/simd128.inl:100, from /usr/include/fflas-ffpack/fflas/fflas_simd.h:229: /usr/include/fflas-ffpack/fflas/fflas_simd/simd128_float.inl:273:36: note: called from here 273 | __m128d t2 = _mm_castps_pd (_mm_permute_ps (b, 0xd8)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/include/avxintrin.h:606:1: error: inlining failed in call to ‘always_inline’ ‘_mm_permute_ps(float __vector(4), int)’: target specific option mismatch 606 | _mm_permute_ps (__m128 __X, const int __C) | ^~~~~~~~~~~~~~ /usr/include/fflas-ffpack/fflas/fflas_simd/simd128_float.inl:272:36: note: called from here 272 | __m128d t1 = _mm_castps_pd (_mm_permute_ps (a, 0xd8)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/lib/gcc/x86_64-pc-linux-gnu/16.1.1/include/avxintrin.h:606:1: error: inlining failed in call to ‘always_inline’ ‘_mm_permute_ps(float __vector(4), int)’: target specific option mismatch 606 | _mm_permute_ps (__m128 __X, const int __C) | ^~~~~~~~~~~~~~ /usr/include/fflas-ffpack/fflas/fflas_simd/simd128_float.inl:273:36: note: called from here 273 | __m128d t2 = _mm_castps_pd (_mm_permute_ps (b, 0xd8)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ make[4]: *** [Makefile:2584: test-fft.o] Error 1 make[4]: *** Waiting for unfinished jobs.... test-blas-domain.C: In function ‘int main(int, char**)’: test-blas-domain.C:192:17: note: ‘#pragma message: #warning GF3 -> working on sliced wrapper’ 192 | #pragma message "#warning GF3 -> working on sliced wrapper" | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/dixon-solver-dense.h:363, from ../linbox/algorithms/rational-solver.h:583, from ../linbox/algorithms/hybrid-det.h:35, from ../linbox/solutions/det.h:600, from test-hadamard-bound.C:25: ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl: In instantiation of ‘LinBox::SolverReturnStatus LinBox::DixonSolver::monolithicSolve(Vector1&, Integer&, const IMatrix&, const Vector2&, LinBox::Method::Dixon) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’: ../linbox/solutions/./solve/solve-dixon.h:119:52: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix<_Field>&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector, std::vector >; Ring = Givaro::ZRing; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer; DenseMatrix<_Field> = BlasMatrix >]’ 119 | status = dixonSolve.monolithicSolve(xNum, xDen, A, b, m); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-auto.h:99:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Auto&) [with IntVector = BlasVector, std::vector >; Matrix = BlasMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 99 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector, std::vector >; Matrix = BlasMatrix >; Vector = BlasVector, std::vector >; SolveMethod = Method::Auto; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:247:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&) [with IntVector = BlasVector, std::vector >; Matrix = BlasMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 247 | solve(xNum, xDen, A, b, Method::Auto()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-hadamard-bound.C:73:10: required from ‘bool test(const Ring&, const TMatrix&, const TVector&) [with TMatrix = LinBox::BlasMatrix >; TVector = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing]’ 73 | solve(num, den, A, b); | ~~~~~^~~~~~~~~~~~~~~~ test-hadamard-bound.C:148:9: required from here 148 | test(F, A0, b0); | ~~~~^~~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:748:21: warning: variable ‘thisrow’ set but not used [-Wunused-but-set-variable=] 748 | int thisrow = 0; | ^~~~~~~ In file included from ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:26: ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::BlasMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::DixonLiftingContainer, Givaro::Modular, LinBox::BlasMatrix >, LinBox::BlasMatrix, std::vector > >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/./dixon-solver/./dixon-solver-dense.inl:135:28: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solveNonsingular(Vector1&, Integer&, const IMatrix&, const Vector2&, bool, int) [with IMatrix = LinBox::BlasMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 135 | if (!re.getRational(num, den, 0)) { | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:106:49: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, DenseMatrix<_Field>&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector, std::vector >; Ring = Givaro::ZRing; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer; DenseMatrix<_Field> = BlasMatrix >]’ 106 | status = dixonSolve.solveNonsingular(xNum, xDen, A, b, false, maxTrials); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-auto.h:99:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Auto&) [with IntVector = BlasVector, std::vector >; Matrix = BlasMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 99 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector, std::vector >; Matrix = BlasMatrix >; Vector = BlasVector, std::vector >; SolveMethod = Method::Auto; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:247:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&) [with IntVector = BlasVector, std::vector >; Matrix = BlasMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 247 | solve(xNum, xDen, A, b, Method::Auto()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-hadamard-bound.C:73:10: required from ‘bool test(const Ring&, const TMatrix&, const TVector&) [with TMatrix = LinBox::BlasMatrix >; TVector = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing]’ 73 | solve(num, den, A, b); | ~~~~~^~~~~~~~~~~~~~~~ test-hadamard-bound.C:148:9: required from here 148 | test(F, A0, b0); | ~~~~^~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ ../linbox/algorithms/lifting-container.h: In instantiation of ‘bool LinBox::LiftingContainerBase<_Ring, _IMatrix>::const_iterator::next(LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector&) [with _Ring = Givaro::ZRing; _IMatrix = LinBox::SparseMatrix >; LinBox::LiftingContainerBase<_Ring, _IMatrix>::IVector = LinBox::BlasVector, std::vector >]’: ../linbox/algorithms/rational-reconstruction.h:790:60: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational3(Vector1&, LinBox::Integer&) const [with Vector1 = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::SparseLULiftingContainer, Givaro::Modular, LinBox::SparseMatrix >, LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq> >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 790 | for (size_t i=0 ; iter != _lcontainer.end() && iter.next(digit_approximation[(size_t)i]);++i) { | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-reconstruction.h:136:25: required from ‘bool LinBox::RationalReconstruction<_LiftingContainer, RatRecon>::getRational(Vector&, LinBox::Integer&, int) const [with Vector = LinBox::BlasVector, std::vector >; _LiftingContainer = LinBox::SparseLULiftingContainer, Givaro::Modular, LinBox::SparseMatrix >, LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq> >; RatRecon = LinBox::RReconstruction, LinBox::ClassicMaxQRationalReconstruction > >; LinBox::Integer = Givaro::Integer]’ 136 | return getRational3 (num, den); | ~~~~~~~~~~~~~^~~~~~~~~~ ../linbox/algorithms/rational-solver.inl:628:22: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int) const [with IMatrix = LinBox::SparseMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 628 | if (!re.getRational(num, den, 0)) | ~~~~~~~~~~~~~~^~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:156:53: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const SparseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector, std::vector >; MatrixArgs = {Givaro::ZRing, SparseMatrixFormat::SparseSeq}; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 156 | SolverReturnStatus status = dixonSolve.solve(xNum, xDen, A, b, maxTrials); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-auto.h:99:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Auto&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 99 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; SolveMethod = Method::Auto; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:247:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 247 | solve(xNum, xDen, A, b, Method::Auto()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-hadamard-bound.C:73:10: required from ‘bool test(const Ring&, const TMatrix&, const TVector&) [with TMatrix = LinBox::SparseMatrix >; TVector = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing]’ 73 | solve(num, den, A, b); | ~~~~~^~~~~~~~~~~~~~~~ test-hadamard-bound.C:112:16: required from ‘bool test_with_matrix_vector(size_t, size_t, int*) [with TMatrix = LinBox::SparseMatrix >; TVector = LinBox::BlasVector, std::vector >; size_t = long unsigned int]’ 112 | return test(F, A, b); | ~~~~^~~~~~~~~ test-hadamard-bound.C:158:81: required from here 158 | ok = ok && test_with_matrix_vector, BlasVector>(n, bitSize, &seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/lifting-container.h:249:37: warning: variable ‘index’ set but not used [-Wunused-but-set-variable=] 249 | int index=0; | ^~~~~ In file included from ../linbox/matrix/sparsematrix/read-write-sparse.h:148, from ../linbox/matrix/sparse-matrix.h:68, from test-hadamard-bound.C:23: ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writeTriple(const Matrix&, std::ostream&, LinBox::MatrixCategories::RowMatrixTag, bool) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:537:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 537 | return writeTriple(A,os,typename MatrixTraits::MatrixCategory (),true); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::Modular; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver.inl:593:12: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int) const [with IMatrix = LinBox::SparseMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 593 | GD.QLUPin(rank,det,Q,L,Ap,P,Ap.rowdim(), Ap.coldim()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:156:53: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const SparseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector, std::vector >; MatrixArgs = {Givaro::ZRing, SparseMatrixFormat::SparseSeq}; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 156 | SolverReturnStatus status = dixonSolve.solve(xNum, xDen, A, b, maxTrials); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-auto.h:99:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Auto&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 99 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; SolveMethod = Method::Auto; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:247:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 247 | solve(xNum, xDen, A, b, Method::Auto()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-hadamard-bound.C:73:10: required from ‘bool test(const Ring&, const TMatrix&, const TVector&) [with TMatrix = LinBox::SparseMatrix >; TVector = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing]’ 73 | solve(num, den, A, b); | ~~~~~^~~~~~~~~~~~~~~~ test-hadamard-bound.C:112:16: required from ‘bool test_with_matrix_vector(size_t, size_t, int*) [with TMatrix = LinBox::SparseMatrix >; TVector = LinBox::BlasVector, std::vector >; size_t = long unsigned int]’ 112 | return test(F, A, b); | ~~~~^~~~~~~~~ test-hadamard-bound.C:158:81: required from here 158 | ok = ok && test_with_matrix_vector, BlasVector>(n, bitSize, &seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:312:31: warning: variable ‘j_idx’ set but not used [-Wunused-but-set-variable=] 312 | size_t i_idx, j_idx; | ^~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl: In instantiation of ‘static std::ostream& LinBox::SparseMatrixWriteHelper::writePretty(const Matrix&, std::ostream&, std::string, std::string, std::string, std::string, std::string, std::string, LinBox::MatrixCategories::RowMatrixTag) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream; std::string = std::__cxx11::basic_string]’: ../linbox/matrix/sparsematrix/read-write-sparse.inl:550:22: required from ‘static std::ostream& LinBox::SparseMatrixWriteHelper::write(const Matrix&, std::ostream&, LinBox::Tag::FileFormat) [with Matrix = LinBox::Protected::SparseMatrixGeneric, std::vector, std::allocator > >, LinBox::VectorCategories::SparseSequenceVectorTag>; std::ostream = std::basic_ostream]’ 550 | return writePretty(A,os,"[","]","","; ",",","",typename MatrixTraits::MatrixCategory ()); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/sparse-sequence-vector.h:193:50: required from ‘std::ostream& LinBox::Protected::SparseMatrixGeneric<_Field, _Row, LinBox::VectorCategories::SparseSequenceVectorTag>::write(std::ostream&, LinBox::Tag::FileFormat) const [with _Field = Givaro::Modular; _Row = std::vector, std::allocator > >; std::ostream = std::basic_ostream]’ 193 | return SparseMatrixWriteHelper::write (*this, os, format); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/gauss/gauss.inl:253:21: required from ‘size_t& LinBox::GaussDomain<_Field>::QLUPin(size_t&, Element&, Perm&, _Matrix&, _Matrix&, Perm&, size_t, size_t) const [with _Matrix = LinBox::SparseMatrix, LinBox::SparseMatrixFormat::SparseSeq>; Perm = LinBox::Permutation, LinBox::BlasMatrix, std::vector > >; _Field = Givaro::Modular; size_t = long unsigned int; Element = double]’ 253 | LigneL.write(rep << "L:= ", Tag::FileFormat::Maple) << ':' << std::endl; | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/algorithms/rational-solver.inl:593:12: required from ‘LinBox::SolverReturnStatus LinBox::DixonSolver::solve(Vector1&, Integer&, const IMatrix&, const Vector2&, int) const [with IMatrix = LinBox::SparseMatrix >; Vector1 = LinBox::BlasVector, std::vector >; Vector2 = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing; Field = Givaro::Modular; RandomPrime = LinBox::PrimeIterator; Integer = Givaro::Integer]’ 593 | GD.QLUPin(rank,det,Q,L,Ap,P,Ap.rowdim(), Ap.coldim()); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-dixon.h:156:53: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const SparseMatrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Dixon&) [with IntVector = BlasVector, std::vector >; MatrixArgs = {Givaro::ZRing, SparseMatrixFormat::SparseSeq}; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 156 | SolverReturnStatus status = dixonSolve.solve(xNum, xDen, A, b, maxTrials); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/./solve/solve-auto.h:99:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const RingCategories::IntegerTag&, const Method::Auto&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 99 | solve(xNum, xDen, A, b, tag, reinterpret_cast(m)); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:238:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&, const SolveMethod&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; SolveMethod = Method::Auto; typename IntVector::Element = Givaro::Integer]’ 238 | solve(xNum, xDen, A, b, typename FieldTraits::categoryTag(), m); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../linbox/solutions/solve.h:247:14: required from ‘void LinBox::solve(IntVector&, typename IntVector::Element&, const Matrix&, const Vector&) [with IntVector = BlasVector, std::vector >; Matrix = SparseMatrix >; Vector = BlasVector, std::vector >; typename IntVector::Element = Givaro::Integer]’ 247 | solve(xNum, xDen, A, b, Method::Auto()); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ test-hadamard-bound.C:73:10: required from ‘bool test(const Ring&, const TMatrix&, const TVector&) [with TMatrix = LinBox::SparseMatrix >; TVector = LinBox::BlasVector, std::vector >; Ring = Givaro::ZRing]’ 73 | solve(num, den, A, b); | ~~~~~^~~~~~~~~~~~~~~~ test-hadamard-bound.C:112:16: required from ‘bool test_with_matrix_vector(size_t, size_t, int*) [with TMatrix = LinBox::SparseMatrix >; TVector = LinBox::BlasVector, std::vector >; size_t = long unsigned int]’ 112 | return test(F, A, b); | ~~~~^~~~~~~~~ test-hadamard-bound.C:158:81: required from here 158 | ok = ok && test_with_matrix_vector, BlasVector>(n, bitSize, &seed); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../linbox/matrix/sparsematrix/read-write-sparse.inl:366:24: warning: variable ‘i_idx’ set but not used [-Wunused-but-set-variable=] 366 | size_t i_idx, j_idx; | ^~~~~ make[4]: Leaving directory '/startdir/src/linbox/tests' make[3]: *** [Makefile:2862: check-TESTS] Error 2 make[3]: Leaving directory '/startdir/src/linbox/tests' make[2]: *** [Makefile:3253: check-am] Error 2 make[2]: Leaving directory '/startdir/src/linbox/tests' make[1]: *** [Makefile:2620: check-recursive] Error 1 make[1]: Leaving directory '/startdir/src/linbox/tests' make: *** [Makefile:597: check-recursive] Error 1 ==> ERROR: A failure occurred in check(). Aborting... ==> ERROR: Build failed, check /home/alhp/workspace/chroot/build_b139ee0e-b97e-4cd8-892d-f19af876e08e/build