>>> libsemigroups: Building testing/libsemigroups 2.7.3-r2 (using abuild 3.18.0_rc5-r1) started Tue, 29 Sep 2026 11:40:34 +0000 >>> libsemigroups: Validating /home/buildozer/aports/testing/libsemigroups/APKBUILD... >>> WARNING: libsemigroups: No maintainer >>> libsemigroups: Analyzing dependencies... >>> libsemigroups: Installing for build: build-base eigen-dev fmt-dev (1/4) Installing eigen-dev (3.4.0-r10) (2/4) Installing fmt (12.2.0-r0) (3/4) Installing fmt-dev (12.2.0-r0) (4/4) Installing .makedepends-libsemigroups (20260929.114035) OK: 300.4 MiB in 109 packages >>> libsemigroups: Cleaning up srcdir >>> libsemigroups: Cleaning up pkgdir >>> libsemigroups: Cleaning up tmpdir >>> libsemigroups: Fetching https://distfiles.alpinelinux.org/distfiles/edge/libsemigroups-2.7.3.tar.gz /var/cache/distfiles/edge/libsemigroups-2.7.3.tar.gz: OK /home/buildozer/aports/testing/libsemigroups/001-gcc-15.patch: OK >>> libsemigroups: Fetching https://distfiles.alpinelinux.org/distfiles/edge/libsemigroups-2.7.3.tar.gz /var/cache/distfiles/edge/libsemigroups-2.7.3.tar.gz: OK /home/buildozer/aports/testing/libsemigroups/001-gcc-15.patch: OK >>> libsemigroups: Unpacking /var/cache/distfiles/edge/libsemigroups-2.7.3.tar.gz... tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.xattr.com.apple.lastuseddate#PS' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' tar: Ignoring unknown extended header keyword 'LIBARCHIVE.creationtime' >>> libsemigroups: 001-gcc-15.patch patching file include/libsemigroups/sims1.tpp checking build system type... armv7-alpine-linux-musleabihf checking host system type... armv7-alpine-linux-musleabihf checking target system type... armv7-alpine-linux-musleabihf checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a race-free mkdir -p... ./config/install-sh -c -d checking for gawk... no checking for mawk... no checking for nawk... no checking for awk... awk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking how to create a pax tar archive... gnutar checking whether make supports nested variables... (cached) yes checking whether make supports the include directive... yes (GNU style) checking for armv7-alpine-linux-musleabihf-gcc... cc 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 cc accepts -g... yes checking for cc option to enable C11 features... none needed checking whether cc understands -c and -o together... yes checking dependency style of cc... gcc3 checking for armv7-alpine-linux-musleabihf-ar... no checking for armv7-alpine-linux-musleabihf-lib... no checking for armv7-alpine-linux-musleabihf-link... no checking for ar... ar checking the archiver (ar) interface... ar checking whether the compiler supports GNU C++... yes checking whether c++ accepts -g... yes checking for c++ option to enable C++11 features... none needed checking dependency style of c++... gcc3 checking whether c++ supports C++14 features by default... yes checking for a sed that does not truncate output... /bin/sed checking how to run the C preprocessor... cc -E checking for grep that handles long lines and -e... /bin/grep checking for egrep... /bin/grep -E checking whether cc is Clang... no checking whether pthreads work with "-pthread" and "-lpthread"... yes checking for joinable pthread attribute... PTHREAD_CREATE_JOINABLE checking whether more special flags are required for pthreads... no checking for PTHREAD_PRIO_INHERIT... yes checking for pthread_create in -lpthread... yes checking whether to enable maintainer-specific portions of Makefiles... no checking whether ln -s works... yes checking how to print strings... printf checking for a sed that does not truncate output... (cached) /bin/sed checking for fgrep... /bin/grep -F checking for ld used by cc... /usr/armv7-alpine-linux-musleabihf/bin/ld checking if the linker (/usr/armv7-alpine-linux-musleabihf/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 the maximum length of command line arguments... 98304 checking how to convert armv7-alpine-linux-musleabihf file names to armv7-alpine-linux-musleabihf format... func_convert_file_noop checking how to convert armv7-alpine-linux-musleabihf file names to toolchain format... func_convert_file_noop checking for /usr/armv7-alpine-linux-musleabihf/bin/ld option to reload object files... -r checking for armv7-alpine-linux-musleabihf-file... no checking for file... file checking for armv7-alpine-linux-musleabihf-objdump... no checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for armv7-alpine-linux-musleabihf-dlltool... no checking for dlltool... no checking how to associate runtime and link libraries... printf %s\n checking for armv7-alpine-linux-musleabihf-ar... ar checking for archiver @FILE support... @ checking for armv7-alpine-linux-musleabihf-strip... no checking for strip... strip checking for armv7-alpine-linux-musleabihf-ranlib... no checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from cc object... ok checking for sysroot... no checking for a working dd... /bin/dd checking how to truncate binary pipes... /bin/dd bs=4096 count=1 checking for armv7-alpine-linux-musleabihf-mt... no 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 for objdir... .libs checking if cc supports -fno-rtti -fno-exceptions... no checking for cc option to produce PIC... -fPIC -DPIC checking if cc PIC flag -fPIC -DPIC works... yes checking if cc static flag -static works... yes checking if cc supports -c -o file.o... yes checking if cc supports -c -o file.o... (cached) yes checking whether the cc linker (/usr/armv7-alpine-linux-musleabihf/bin/ld) 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... c++ -E checking for ld used by c++... /usr/armv7-alpine-linux-musleabihf/bin/ld checking if the linker (/usr/armv7-alpine-linux-musleabihf/bin/ld) is GNU ld... yes checking whether the c++ linker (/usr/armv7-alpine-linux-musleabihf/bin/ld) supports shared libraries... yes checking for c++ option to produce PIC... -fPIC -DPIC checking if c++ PIC flag -fPIC -DPIC works... yes checking if c++ static flag -static works... yes checking if c++ supports -c -o file.o... yes checking if c++ supports -c -o file.o... (cached) yes checking whether the c++ linker (/usr/armv7-alpine-linux-musleabihf/bin/ld) supports shared libraries... yes checking dynamic linker characteristics... (cached) GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for limits.h... yes checking for stdint.h... (cached) yes checking for stdlib.h... (cached) yes checking for sys/time.h... yes checking for unistd.h... (cached) yes checking for pthread.h... yes checking for _Bool... yes checking for stdbool.h that conforms to C99... yes checking for inline... inline checking for int64_t... yes checking for size_t... yes checking for uint64_t... yes checking for ptrdiff_t... yes checking size of void *... 4 checking for GNU libc compatible malloc... yes checking for gettimeofday... yes checking for memset... yes checking for pow... yes checking for sqrt... yes checking whether to enable debug mode... no checking whether to enable verbose mode... no checking whether enable compiler warnings... no checking whether to enable stats mode... yes checking whether to enable backward mode... yes checking for execinfo.h... no configure: WARNING: backward enabled but execinfo.h not found, disabling backward! checking whether to build with code coverage support... no checking whether to enable HPCombi... yes checking for ./extern/HPCombi/VERSION... yes checking the required version of HPCombi... 0.0.6 checking the version of HPCombi that's present... 0.0.6 checking whether C++ compiler accepts -mavx... no configure: WARNING: flag -mavx not supported, HPCombi is disabled checking for armv7-alpine-linux-musleabihf-pkg-config... no checking for pkg-config... /usr/bin/pkg-config checking pkg-config is at least version 0.9.0... yes checking whether to enable fmt... yes checking whether to use external fmt... yes checking for fmt >= 8.1.1... yes checking whether to enable eigen... yes checking whether to use external eigen... yes checking for eigen3 >= 3.3.7... yes checking for __builtin_popcountl... yes checking for __builtin_clzll... yes checking whether to try and use __builtin_popcntl... yes checking whether to try and use __builtin_clzlll... yes checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating libsemigroups.pc config.status: creating config/config.h config.status: executing depfiles commands config.status: executing include/libsemigroups/config.hpp commands config.status: creating include/libsemigroups/config.hpp - prefix LIBSEMIGROUPS for config/config.h defines config.status: executing libtool commands CXX src/libsemigroups_la-bipart.lo CXX src/libsemigroups_la-bmat8.lo CXX src/libsemigroups_la-cong-intf.lo CXX src/libsemigroups_la-cong-pair.lo CXX src/libsemigroups_la-cong.lo CXX src/libsemigroups_la-constants.lo CXX src/libsemigroups_la-coset.lo CXX src/libsemigroups_la-exception.lo CXX src/libsemigroups_la-felsch-tree.lo CXX src/libsemigroups_la-forest.lo CXX src/libsemigroups_la-fpsemi-examples.lo CXX src/libsemigroups_la-fpsemi-intf.lo CXX src/libsemigroups_la-fpsemi.lo CXX src/libsemigroups_la-freeband.lo CXX src/libsemigroups_la-froidure-pin-base.lo CXX src/libsemigroups_la-kambites.lo CXX src/libsemigroups_la-knuth-bendix.lo CXX src/libsemigroups_la-make-present.lo CXX src/libsemigroups_la-node-manager.lo CXX src/libsemigroups_la-obvinf.lo CXX src/libsemigroups_la-pbr.lo CXX src/libsemigroups_la-race.lo CXX src/libsemigroups_la-report.lo CXX src/libsemigroups_la-runner.lo CXX src/libsemigroups_la-siso.lo CXX src/libsemigroups_la-string.lo CXX src/libsemigroups_la-stephen.lo CXX src/libsemigroups_la-timer.lo CXX src/libsemigroups_la-todd-coxeter.lo CXX src/libsemigroups_la-ukkonen.lo CXX src/libsemigroups_la-wilo.lo CXX src/libsemigroups_la-wislo.lo CXX src/libsemigroups_la-word.lo CXXLD libsemigroups.la make test_all make[1]: Entering directory '/home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3' CXX tests/bmat-data.o CXX tests/test-action.o CXX tests/test-bipart.o CXX tests/test-bitset.o CXX tests/test-bmat8.o CXX tests/test-cong-intf.o CXX tests/test-cong-pair.o CXX tests/test-cong.o CXX tests/test-constants.o CXX tests/test-containers.o CXX tests/test-digraph-helper.o CXX tests/test-digraph.o CXX tests/test-felsch-tree.o CXX tests/test-forest.o CXX tests/test-fpsemi.o CXX tests/test-fpsemi-examples-1.o CXX tests/test-fpsemi-examples-2.o CXX tests/test-fpsemi-examples-3.o CXX tests/test-fpsemi-intf.o CXX tests/test-freeband.o CXX tests/test-froidure-pin-bipart.o CXX tests/test-froidure-pin-bmat8.o CXX tests/test-froidure-pin-bmat.o CXX tests/test-froidure-pin-integers.o CXX tests/test-froidure-pin-intmat.o CXX tests/test-froidure-pin-intpairs.o CXX tests/test-froidure-pin-matrix.o CXX tests/test-froidure-pin-maxplustrunc.o CXX tests/test-froidure-pin-pbr.o CXX tests/test-froidure-pin-pperm.o CXX tests/test-froidure-pin-projmaxplus.o CXX tests/test-froidure-pin-transf.o CXX tests/test-hpcombi.o CXX tests/test-iterator.o CXX tests/test-kambites.o CXX tests/test-kbe.o CXX tests/test-knuth-bendix-1.o CXX tests/test-knuth-bendix-2.o CXX tests/test-knuth-bendix-3.o CXX tests/test-knuth-bendix-4.o CXX tests/test-knuth-bendix-5.o CXX tests/test-knuth-bendix-6.o CXX tests/test-konieczny-bmat8-1.o CXX tests/test-konieczny-bmat8-2.o CXX tests/test-konieczny-bmat8-3.o CXX tests/test-konieczny-transf.o CXX tests/test-konieczny-bmat.o CXX tests/test-konieczny-pperm.o CXX tests/test-main.o CXX tests/test-make-present.o CXX tests/test-make-froidure-pin.o CXX tests/test-matrix.o CXX tests/test-obvinf.o CXX tests/test-order.o CXX tests/test-pbr.o CXX tests/test-pool.o CXX tests/test-present.o CXX tests/test-race.o CXX tests/test-runner.o CXX tests/test-schreier-sims.o CXX tests/test-schreier-sims-helper.o CXX tests/test-sims1.o CXX tests/test-siso.o CXX tests/test-stephen.o CXX tests/test-string.o CXX tests/test-string-view.o CXX tests/test-timer.o CXX tests/test-todd-coxeter.o CXX tests/test-types.o CXX tests/test-uf.o CXX tests/test-ukkonen.o CXX tests/test-wilo.o CXX tests/test-wislo.o CXX tests/test-word.o In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61, from /usr/include/c++/15.2.0/algorithm:63, from tests/catch.hpp:3598, from tests/test-froidure-pin-maxplustrunc.cpp:24: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Distance = int; _Tp = array; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Val_less_iter]': /usr/include/c++/15.2.0/bits/stl_algo.h:1751:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1751 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/15.2.0/bits/stl_algo.h:1590:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1590 | __heap_select(_RandomAccessIterator __first, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1590:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1590:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 In function 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_algo.h:1869:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1869 | std::__heap_select(__first, __middle, __last, __comp); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]': /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4841:18, inlined from 'void libsemigroups::tropical_max_plus_row_basis(std::vector >&) [with unsigned int dim = 2; unsigned int thresh = 9]' at tests/test-froidure-pin-maxplustrunc.cpp:70:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4841:18, inlined from 'void libsemigroups::tropical_max_plus_row_basis(std::vector >&) [with unsigned int dim = 2; unsigned int thresh = 9]' at tests/test-froidure-pin-maxplustrunc.cpp:70:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61, from /usr/include/c++/15.2.0/algorithm:63, from tests/catch.hpp:3598, from tests/test-konieczny-bmat8-3.cpp:20: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = libsemigroups::BMat8; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In file included from /usr/include/c++/15.2.0/vector:74, from tests/catch.hpp:564: /usr/include/c++/15.2.0/bits/vector.tcc: In function 'void std::vector<_Tp, _Alloc>::_M_assign_aux(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::__detail::_Node_iterator; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]': /usr/include/c++/15.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 318 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61, from /usr/include/c++/15.2.0/algorithm:63, from tests/test-konieczny-bmat8-2.cpp:18: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = libsemigroups::BMat8; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In file included from /usr/include/c++/15.2.0/vector:74, from tests/test-konieczny-bmat8-2.cpp:21: /usr/include/c++/15.2.0/bits/vector.tcc: In function 'void std::vector<_Tp, _Alloc>::_M_assign_aux(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::__detail::_Node_iterator; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]': /usr/include/c++/15.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 318 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61, from /usr/include/c++/15.2.0/algorithm:63, from tests/catch.hpp:3598, from tests/test-konieczny-bmat8-1.cpp:20: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = libsemigroups::BMat8; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In file included from /usr/include/c++/15.2.0/vector:74, from tests/catch.hpp:564: /usr/include/c++/15.2.0/bits/vector.tcc: In function 'void std::vector<_Tp, _Alloc>::_M_assign_aux(_ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = std::__detail::_Node_iterator; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]': /usr/include/c++/15.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 318 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61, from /usr/include/c++/15.2.0/algorithm:63, from tests/test-action.cpp:21: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Distance = int; _Tp = libsemigroups::BitSet<5>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type 'libsemigroups::BitSet<5>' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1594:23, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1869:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:356:29: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<5>'} changed in GCC 7.1 356 | std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 357 | __comp); | ~~~~~~~ In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_heap.h:425:19, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1870:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<5>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:264:25: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<5>'} changed in GCC 7.1 264 | std::__adjust_heap(__first, _DistanceType(0), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 265 | _DistanceType(__last - __first), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 266 | _GLIBCXX_MOVE(__value), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]': /usr/include/c++/15.2.0/bits/vector.tcc:652:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 652 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:74, from tests/test-stephen.cpp:33: /usr/include/c++/15.2.0/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]': /usr/include/c++/15.2.0/bits/vector.tcc:652:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 652 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:74, from tests/test-action.cpp:24: /usr/include/c++/15.2.0/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]': /usr/include/c++/15.2.0/bits/vector.tcc:652:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 652 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:68: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61, from /usr/include/c++/15.2.0/algorithm:63, from tests/test-matrix.cpp:17: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Distance = int; _Tp = libsemigroups::BitSet<3>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type 'libsemigroups::BitSet<3>' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:68: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]', inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:324:22, inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:321:19, inlined from 'libsemigroups::detail::DynamicArray2::DynamicArray2(size_type, size_type, T) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:154:23, inlined from 'uint64_t libsemigroups::ActionDigraph::number_of_paths_acyclic(node_type, size_t, size_t) const [with T = unsigned int]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/digraph.hpp:2865:12: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Distance = int; _Tp = libsemigroups::BitSet<32>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type 'libsemigroups::BitSet<32>' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Distance = int; _Tp = libsemigroups::BitSet<2>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type 'libsemigroups::BitSet<2>' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]', inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:324:22, inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:321:19, inlined from 'libsemigroups::detail::DynamicArray2::DynamicArray2(size_type, size_type, T) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:154:23, inlined from 'uint64_t libsemigroups::ActionDigraph::number_of_paths_acyclic(node_type, node_type, size_t, size_t) const [with T = unsigned int]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/digraph.hpp:2928:12: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1594:23, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1869:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:356:29: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<3>'} changed in GCC 7.1 356 | std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 357 | __comp); | ~~~~~~~ In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_heap.h:425:19, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1870:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<3>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:264:25: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<3>'} changed in GCC 7.1 264 | std::__adjust_heap(__first, _DistanceType(0), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 265 | _DistanceType(__last - __first), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 266 | _GLIBCXX_MOVE(__value), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1594:23, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1869:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:356:29: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<32>'} changed in GCC 7.1 356 | std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 357 | __comp); | ~~~~~~~ In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_heap.h:425:19, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1870:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:264:25: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<32>'} changed in GCC 7.1 264 | std::__adjust_heap(__first, _DistanceType(0), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 265 | _DistanceType(__last - __first), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 266 | _GLIBCXX_MOVE(__value), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1594:23, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1869:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:356:29: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<2>'} changed in GCC 7.1 356 | std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 357 | __comp); | ~~~~~~~ In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_heap.h:425:19, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1870:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<2>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:264:25: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<2>'} changed in GCC 7.1 264 | std::__adjust_heap(__first, _DistanceType(0), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 265 | _DistanceType(__last - __first), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 266 | _GLIBCXX_MOVE(__value), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]': /usr/include/c++/15.2.0/bits/vector.tcc:652:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 652 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]': /usr/include/c++/15.2.0/bits/vector.tcc:652:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 652 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61, from /usr/include/c++/15.2.0/algorithm:63, from tests/catch.hpp:3598, from tests/test-konieczny-bmat.cpp:20: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Distance = int; _Tp = libsemigroups::BitSet<32>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type 'libsemigroups::BitSet<32>' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1594:23, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1869:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:356:29: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<32>'} changed in GCC 7.1 356 | std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 357 | __comp); | ~~~~~~~ In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]', inlined from 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_heap.h:425:19, inlined from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1870:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = libsemigroups::BitSet<32>*; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1885:27: /usr/include/c++/15.2.0/bits/stl_heap.h:264:25: note: parameter passing for argument of type '_ValueType' {aka 'libsemigroups::BitSet<32>'} changed in GCC 7.1 264 | std::__adjust_heap(__first, _DistanceType(0), | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 265 | _DistanceType(__last - __first), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 266 | _GLIBCXX_MOVE(__value), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:68: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:68: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::assign(_InputIterator, _InputIterator) [with _InputIterator = std::__detail::_Node_iterator; = void; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]', inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3418:17: /usr/include/c++/15.2.0/bits/stl_vector.h:896:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 896 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::assign(_InputIterator, _InputIterator) [with _InputIterator = std::__detail::_Node_iterator; = void; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]', inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3427:17: /usr/include/c++/15.2.0/bits/stl_vector.h:896:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 896 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3429:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3429:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3430:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3430:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'bool libsemigroups::Konieczny::RegularDClass::contains(libsemigroups::Konieczny::const_reference, libsemigroups::Konieczny::lambda_orb_index_type, libsemigroups::Konieczny::rho_orb_index_type) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:2628:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'bool libsemigroups::Konieczny::RegularDClass::contains(libsemigroups::Konieczny::const_reference, libsemigroups::Konieczny::lambda_orb_index_type, libsemigroups::Konieczny::rho_orb_index_type) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:2628:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3523:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3523:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3535:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3535:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3613:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3613:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3625:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3625:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:68: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::assign(_InputIterator, _InputIterator) [with _InputIterator = std::__detail::_Node_iterator; = void; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]', inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3418:17: /usr/include/c++/15.2.0/bits/stl_vector.h:896:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 896 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::assign(_InputIterator, _InputIterator) [with _InputIterator = std::__detail::_Node_iterator; = void; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]', inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3427:17: /usr/include/c++/15.2.0/bits/stl_vector.h:896:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 896 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3429:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3429:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3430:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3430:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_from_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:582:40: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'bool libsemigroups::Konieczny::RegularDClass::contains(libsemigroups::Konieczny::const_reference, libsemigroups::Konieczny::lambda_orb_index_type, libsemigroups::Konieczny::rho_orb_index_type) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:2628:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'bool libsemigroups::Konieczny::RegularDClass::contains(libsemigroups::Konieczny::const_reference, libsemigroups::Konieczny::lambda_orb_index_type, libsemigroups::Konieczny::rho_orb_index_type) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:2628:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/algorithm:63, from tests/catch.hpp:3598, from tests/test-bmat8.cpp:24: /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3523:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3523:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3535:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3535:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3613:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3613:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3625:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3625:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageRightAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::right]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = std::pair; _Alloc = std::allocator >]', inlined from 'void libsemigroups::Action::MultiplierCache::init(libsemigroups::Action::index_type, const libsemigroups::Action::element_type&) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:832:30, inlined from 'libsemigroups::Action::element_type libsemigroups::Action::multiplier_to_scc_root(index_type) [with TElementType = libsemigroups::BMat8; TPointType = libsemigroups::BMat8; TActionType = libsemigroups::ImageLeftAction; TTraits = libsemigroups::ActionTraits; libsemigroups::side TLeftOrRight = libsemigroups::side::left]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:647:38: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'bool libsemigroups::Konieczny::RegularDClass::contains(libsemigroups::Konieczny::const_reference, libsemigroups::Konieczny::lambda_orb_index_type, libsemigroups::Konieczny::rho_orb_index_type) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:2628:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'bool libsemigroups::Konieczny::RegularDClass::contains(libsemigroups::Konieczny::const_reference, libsemigroups::Konieczny::lambda_orb_index_type, libsemigroups::Konieczny::rho_orb_index_type) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:2628:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::assign(_InputIterator, _InputIterator) [with _InputIterator = std::__detail::_Node_iterator; = void; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]', inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3418:17: /usr/include/c++/15.2.0/bits/stl_vector.h:896:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 896 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::assign(_InputIterator, _InputIterator) [with _InputIterator = std::__detail::_Node_iterator; = void; _Tp = libsemigroups::BMat8; _Alloc = std::allocator]', inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3427:17: /usr/include/c++/15.2.0/bits/stl_vector.h:896:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 896 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3429:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3429:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3430:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_H_class() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3430:16: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3523:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3523:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3535:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3535:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3613:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3613:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3625:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::Konieczny::NonRegularDClass::compute_mults() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::KoniecznyTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/konieczny.hpp:3625:22: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:74, from tests/test-digraph.cpp:27: /usr/include/c++/15.2.0/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]': /usr/include/c++/15.2.0/bits/vector.tcc:652:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 652 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin.hpp:1296, from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/cong-pair.hpp:74, from tests/test-cong.cpp:22: /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp: In constructor 'libsemigroups::FroidurePin::FroidurePin(std::initializer_list::value_type>) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]': /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:31:22: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 31 | #define FROIDURE_PIN FroidurePin | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:81:3: note: in expansion of macro 'FROIDURE_PIN' 81 | FROIDURE_PIN::FroidurePin(std::initializer_list gens) | ^~~~~~~~~~~~ In file included from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin.hpp:1296, from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/kambites.hpp:56, from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/fpsemi.hpp:30, from tests/test-todd-coxeter.cpp:46: /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp: In constructor 'libsemigroups::FroidurePin::FroidurePin(std::initializer_list::value_type>) [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]': /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:31:22: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 31 | #define FROIDURE_PIN FroidurePin | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:81:3: note: in expansion of macro 'FROIDURE_PIN' 81 | FROIDURE_PIN::FroidurePin(std::initializer_list gens) | ^~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/15.2.0/vector:68: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]', inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:324:22, inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:321:19, inlined from 'libsemigroups::detail::DynamicArray2::DynamicArray2(size_type, size_type, T) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:154:23, inlined from 'uint64_t libsemigroups::ActionDigraph::number_of_paths_acyclic(node_type, node_type, size_t, size_t) const [with T = unsigned int]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/digraph.hpp:2928:12: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]', inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:324:22, inlined from 'void libsemigroups::detail::DynamicArray2::add_rows(size_type) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:321:19, inlined from 'libsemigroups::detail::DynamicArray2::DynamicArray2(size_type, size_type, T) [with T = long long unsigned int; A = std::allocator]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:154:23, inlined from 'uint64_t libsemigroups::ActionDigraph::number_of_paths_acyclic(node_type, size_t, size_t) const [with T = unsigned int]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/digraph.hpp:2865:12: /usr/include/c++/15.2.0/bits/stl_vector.h:1167:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1167 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ tests/test-cong.cpp: In function 'void libsemigroups::____C_A_T_C_H____T_E_S_T____58()': tests/test-cong.cpp:886:54: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 886 | FroidurePin S({gens[0], gens[2], gens[3]}); | ^ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::StaticRowView*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >():: >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = libsemigroups::StaticRowView*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >():: >]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = libsemigroups::StaticRowView*; _Compare = libsemigroups::{anonymous}::test_BMat000 >()::]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::{anonymous}::test_BMat000() [with Mat = libsemigroups::StaticMatrix]' at tests/test-matrix.cpp:166:18: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: warning: array subscript 16 is outside array bounds of 'libsemigroups::detail::StaticVector1, 2> [1]' [-Warray-bounds=] 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ tests/test-matrix.cpp: In function 'void libsemigroups::{anonymous}::test_BMat000() [with Mat = libsemigroups::StaticMatrix]': tests/test-matrix.cpp:160:14: note: at offset 64 into object 'r' of size 12 160 | auto r = matrix_helpers::rows(m); | ^ In file included from /usr/include/c++/15.2.0/algorithm:63, from tests/test-todd-coxeter.cpp:20: /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ tests/test-todd-coxeter.cpp: In function 'void libsemigroups::congruence::____C_A_T_C_H____T_E_S_T____72()': tests/test-todd-coxeter.cpp:1630:78: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 1630 | {BMat8({{0, 1, 0, 0}, {1, 0, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}})}); | ^ In file included from /usr/include/c++/15.2.0/algorithm:63, from tests/catch.hpp:3598, from tests/test-cong.cpp:19: /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1771 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1771:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In file included from /usr/include/c++/15.2.0/bits/stl_algo.h:61: /usr/include/c++/15.2.0/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]': /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1877 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1877:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/15.2.0/bits/stl_algo.h:1891:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1891 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1906:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1906 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1907 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1908 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]', inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::init_sorted()::&, const pair&)> >]' at /usr/include/c++/15.2.0/bits/stl_algo.h:1909:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Compare = libsemigroups::FroidurePin::init_sorted()::&, const pair&)>]' at /usr/include/c++/15.2.0/bits/stl_algo.h:4874:18, inlined from 'void libsemigroups::FroidurePin::init_sorted() [with TElementType = libsemigroups::BMat8; TTraits = libsemigroups::FroidurePinTraits]' at /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/froidure-pin-impl.hpp:991:14: /usr/include/c++/15.2.0/bits/stl_algo.h:1818:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1818 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/15.2.0/bits/stl_algo.h:1823:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1823 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ tests/test-todd-coxeter.cpp: In function 'void libsemigroups::congruence::____C_A_T_C_H____T_E_S_T____24()': tests/test-todd-coxeter.cpp:631:76: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 631 | BMat8({{1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 0}})}); | ^ CXXLD test_all make[1]: Leaving directory '/home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3' ./test_all --use-colour yes --order lex --abort [quick] Filters: [quick] Action 001: row and column basis orbits for BMat8 . . . 275μs Action 002: row and column basis orbits for BMat8 . . . 15ms Action 003: add generators after enumeration . . . 13ms Action 004: multipliers for BMat8 row and column orbits . . . 20ms Action 005: orbits for regular boolean mat monoid 5 . . . 4294ms Action 007: partial perm image orbit . . . 296μs Action 008: partial perm image orbit . . . 79ms Action 009: partial perm image orbit . . . 86ms Action 010: partial perm image orbit . . . 85ms Action 011: permutation on integers . . . 14μs Action 012: permutation on sets, arrays . . . 179μs Action 013: permutation on tuples, arrays . . . 18ms Action 014: permutation on sets, vectors . . . 232μs Action 015: permutation on tuples, vectors . . . 23ms Action 016: misc . . . 207μs Action 017: partial perm image orbit . . . 29μs Action 018: permutation on tuples, arrays (360360) . . . 273ms Action 019: orbits for regular BMat8 monoid 5 with stop/start . . . 4294ms Action 021: orbits for regular boolean mat monoid 5 (BMat<5> [...] . . . 458ms ActionDigraph 000: constructor with 1 default arg . . . 91μs ActionDigraph 001: constructor with 0 default args . . . 25μs ActionDigraph 002: add nodes . . . 14μs ActionDigraph 003: add edges . . . 240μs ActionDigraph 004: strongly connected components - cycles . . . 15μs ActionDigraph 005: strongly connected components - no edges . . . 31ms ActionDigraph 006: strongly connected components - disjoint cycles . . . 1421μs ActionDigraph 007: strongly connected components - complete graphs . . . 652μs ActionDigraph 008: exceptions . . . 33μs ActionDigraph 009: spanning forest - complete graphs . . . 2703μs ActionDigraph 010: spanning forest - disjoint cycles . . . 83μs ActionDigraph 011: restrict . . . 6000ns ActionDigraph 012: remove_edge_nc . . . 5000ns ActionDigraph 013: scc large cycle . . . 14ms ActionDigraph 014: random . . . 99μs ActionDigraph 015: reserve . . . 5000ns ActionDigraph 016: default constructors . . . 9000ns ActionDigraph 017: scc iterators . . . 1656μs ActionDigraph 018: iterator to edges . . . 684μs ActionDigraph 019: root of scc . . . 280μs ActionDigraph 020: cbegin/end_panislo - 100 node path . . . 407μs ActionDigraph 021: cbegin/end_pislo . . . 33μs ActionDigraph 022: cbegin/end_pani(s)lo - 100 node cycle . . . 466μs ActionDigraph 023: cbegin/cend_pilo - tree 14 nodes . . . 55μs ActionDigraph 024: cbegin/end_pstilo - Cayley digraph . . . 148ms ActionDigraph 025: cbegin_pstilo - Tsalakou . . . 893μs ActionDigraph 026: cbegin/end_pstislo - Cayley digraph . . . 153ms ActionDigraph 027: cbegin/end_pstislo - Cayley digraph . . . 148μs ActionDigraph 028: path iterators corner cases . . . 165μs ActionDigraph 029: reverse node iterator . . . 6000ns ActionDigraph 030: pstilo corner case . . . 44μs ActionDigraph 031: number_of_paths corner cases . . . 41μs ActionDigraph 032: number_of_paths acyclic digraph . . . 8490μs ActionDigraph 033: number_of_paths binary tree . . . 377ms ActionDigraph 034: number_of_paths large binary tree . . . 112ms ActionDigraph 035: number_of_paths 400 node random digraph . . . 957μs ActionDigraph 036: number_of_paths 10 node acyclic digraph . . . 32μs ActionDigraph 037: number_of_paths node digraph . . . 3959μs ActionDigraph 038: random/random_acyclic exceptions . . . 61μs ActionDigraph 039: unsafe (next) neighbour . . . 53μs ActionDigraph 040: number_of_egdes incident to a node . . . 50μs ActionDigraph 041: number_of_paths (matrix) . . . 23ms ActionDigraph 042: number_of_paths (matrix) . . . 9000ns ActionDigraph 043: swap_edge_nc . . . 5000ns ActionDigraph 044: detail::pow for non-square Eigen matrix . . . 11μs ActionDigraph 045: operator<< . . . 8000ns Array2 044: all . . . 104μs BMat8 001: transpose . . . 12μs BMat8 002: multiplication . . . 12μs BMat8 003: identity matrix . . . 8000ns BMat8 004: random . . . 143μs BMat8 005: call operator . . . 12μs BMat8 006: operator<< . . . 9000ns BMat8 007: set . . . 34μs BMat8 008: row space basis . . . 668μs BMat8 009: col space basis . . . 684μs BMat8 010: row space basis . . . 30ms BMat8 011: number_of_rows, number_of_cols . . . 28μs BMat8 012: row_space, col_space . . . 163μs BMat8 013: rows . . . 29μs BMat8 014: one . . . 7000ns BMat8 015: vector constructor . . . 40μs BMat8 016: operator< . . . 9000ns BMat8 017: adapters . . . 13μs BMat8 018: one . . . 6000ns Bipartition 009: mem fns 1 . . . 18μs Bipartition 010: hash . . . 4000ns Bipartition 011: mem fns 2 . . . 14μs Bipartition 012: delete/copy . . . 4000ns Bipartition 013: degree 0 . . . 5000ns Bipartition 014: exceptions . . . 15μs Bipartition 015: convenience constructor . . . 140μs Bipartition 016: force copy constructor over move constructor . . . 10μs Bipartition 017: adapters . . . 4000ns BitSet 000: size . . . 76μs BitSet 001: operator< . . . 6000ns BitSet 002: operator== . . . 6000ns BitSet 003: operator!= . . . 6000ns BitSet 004: operator&= . . . 7000ns BitSet 005: & . . . 10μs BitSet 006: operator|= . . . 10μs BitSet 007: operator[] . . . 10μs BitSet 008: set(none) . . . 14μs BitSet 009: set(pos, value) . . . 10μs BitSet 010: set(first, last, value) . . . 12μs BitSet 011: reset(first, last) . . . 11μs BitSet 012: reset(pos) . . . 11μs BitSet 013: apply (iterate through set bits) . . . 12μs BitSet 014: std::hash . . . 4000ns BitSet 015: constructors . . . 11μs BitSet 016: max_size . . . 4000ns BitSet 017: insertion operators . . . 7000ns Blocks 001: empty blocks . . . 6000ns Blocks 002: non-empty blocks . . . 7000ns Blocks 003: left blocks of bipartition . . . 7000ns Blocks 004: right blocks of bipartition . . . 7000ns Blocks 005: copy [empty blocks] . . . 6000ns Blocks 006: copy [non-empty blocks] . . . 6000ns Blocks 007: hash value . . . 7000ns Blocks 008: operator< . . . 6000ns Congruence 000: left congruence on fp semigroup . . . 618μs Congruence 001: 2-sided congruence on fp semigroup . . . 372μs Congruence 002: left congruence on fp semigroup . . . 153μs Congruence 003: word_to_class_index for cong. on fp semigroup . . . 154μs Congruence 004: word_to_class_index for cong. on fp semigroup . . . 324μs Congruence 005: trivial congruence on non-fp semigroup . . . 424μs Congruence 006: 2-sided congruence on non-fp semigroup . . . 248μs Congruence 007: 2-sided congruence on fp semigroup . . . 656μs Congruence 008: 2-sided congruence on infinite fp semigroup . . . 230μs Congruence 009: 2-sided congruence on infinite fp semigroup . . . 272μs Congruence 010: 2-sided congruence on finite semigroup . . . 23ms Congruence 012: 2-sided congruence on finite semigroup . . . 2332μs Congruence 013: trivial 2-sided congruence on bicyclic monoid . . . 15ms Congruence 014: non-trivial 2-sided congruence on bicyclic monoid . . . 281μs Congruence 015: 2-sided congruence on free abelian monoid . . . 243μs Congruence 016: example where TC works but KB doesn't . . . 398μs Congruence 017: 2-sided congruence on finite semigroup . . . 276μs Congruence 018: infinite fp semigroup from GAP library . . . 342μs Congruence 019: 2-sided cong. on fp semigroup with infinite [...] . . . 205μs Congruence 020: trivial cong. on an fp semigroup . . .  -- with compute size 219μs  -- with don't compute size 199μs Congruence 021: duplicate generators . . . 363μs Congruence 022: non-trivial classes . . . 765μs Congruence 023: right congruence on finite semigroup . . . 229ms Congruence 024: redundant generating pairs . . . 96μs Congruence 025: 2-sided cong. on free semigroup . . . 203μs Congruence 026: is_quotient_obviously_(in)finite . . . 582μs Congruence 027: less . . . 199μs Congruence 028: 2-sided congruences of BMat8 semigroup . . . 4294ms Congruence 029: left congruence on finite semigroup . . . 404μs Congruence 030: right congruence on finite semigroup . . . 414μs Congruence 031: right congruence on finite semigroup . . . 330μs Congruence 032: contains . . . 122μs Congruence 033: stellar_monoid S2 . . . 370μs Congruence 034: stellar_monoid S3 . . . 557μs Congruence 035: stellar_monoid S4 . . . 1081μs Congruence 036: stellar_monoid S5 . . . 5860μs Congruence 037: stellar_monoid S6 . . . 53ms Congruence 038: stellar_monoid S7 . . . 732ms Congruence 039: left cong. on an f.p. semigroup . . . 765μs Congruence 040: 2-sided cong. on infinite f.p. semigroup . . . 135μs Congruence 041: 2-sided congruence constructed from type only . . . 240μs Congruence 042: const_contains . . . 414μs Congruence 043: no winner . . . 4943μs Congruence 044: congruence over smalloverlap . . . 7699μs CongruenceByPairs 001: (cong) 2-sided cong. on finite semigroup . . . 404μs CongruenceByPairs 002: (cong) left congruence on finite semigroup . . . 126μs CongruenceByPairs 003: (cong) right congruence on finite semigroup . . . 126μs CongruenceByPairs 004: (cong) trivial congruence on finite s [...] . . . 80μs CongruenceByPairs 005: (cong) trivial left congruence on fin [...] . . . 68μs CongruenceByPairs 006: (cong) trivial right congruence on fi [...] . . . 66μs CongruenceByPairs 007: (cong) universal congruence on finite [...] . . . 426μs CongruenceByPairs 009: (cong) 2-sided congruence on finite s [...] . . . 806ms CongruenceByPairs 010: (cong) left congruence on big finite [...] . . . 34ms CongruenceByPairs 011: (cong) left congruence on TCE . . . 165μs CongruenceByPairs 012: (cong) is_quotient_obviously_finite . . . 79μs CongruenceByPairs 013: (cong) class_index_to_word/quotient . . .  -- with right congruence 7522μs  -- with left congruence 1191μs  -- with 2-sided congruence 7675μs CongruenceByPairs 014: (cong) const_word_to_class_index . . .  -- with right congruence 26μs  -- with left congruence 19μs  -- with 2-sided congruence 18μs CongruenceByPairs 015: (cong) size non-Element* . . . 28ms CongruenceInterface 000: add_pair . . .  -- with ToddCoxeter 97μs  -- with KnuthBendix 116μs  -- with CongruenceByPairs 118μs  -- with Congruence 364μs CongruenceInterface 001: contains/const_contains . . .  -- with ToddCoxeter and no parent 90μs  -- with KnuthBendix and no parent 81μs  -- with Congruence and parent 287μs  -- with CongruenceByPairs and parent 92μs CongruenceInterface 002: less . . .  -- with ToddCoxeter 73μs  -- with KnuthBendix 106μs  -- with CongruenceByPairs 84μs  -- with Congruence 321μs CongruenceInterface 003: is_quotient_obviously_(in)finite . . .  -- with ToddCoxeter 58μs  -- with KnuthBendix 94μs CongruenceInterface 004: is_quotient_obviously_(in)finite . . .  -- with CongruenceByPairs 93μs  -- with Congruence 296μs CongruenceInterface 005: parent_froidure_pin . . .  -- with ToddCoxeter 16μs  -- with KnuthBendix 11μs CongruenceInterface 006: parent_froidure_pin . . .  -- with CongruenceByPairs 97μs  -- with Congruence 256μs CongruenceInterface 007: cbegin/cend_ntc . . .  -- with ToddCoxeter 219μs  -- with KnuthBendix 1008μs CongruenceInterface 008: cbegin/cend_ntc . . .  -- with CongruenceByPairs 175μs  -- with Congruence 384μs CongruenceInterface 009: quotient is immutable . . .  -- with ToddCoxeter 84μs  -- with KnuthBendix 88μs  -- with Congruence 155μs CongruenceInterface 010: no generating pairs added . . .  -- with KnuthBendix and common behaviour 4620μs  -- with Congruence and common behaviour 4757μs  -- with ToddCoxeter 43μs CongruenceInterface 011: nr generators not set . . .  -- with ToddCoxeter 56μs  -- with KnuthBendix 42μs  -- with Congruence 45μs CongruenceInterface 012: no generating pairs . . . 150μs ConstIteratorStateless 001: ? . . . 5000ns ConstIteratorStateless 002: ? . . . 4000ns Constants 001: Undefined . . . 8000ns Constants 002: PositiveInfinity . . . 10μs Constants 003: NegativeInfinity . . . 8000ns Constants 004: LimitMax . . . 9000ns Duf 004: unite . . . 83μs Duf 006: compress . . . 9000ns Duf 008: resize . . . 11μs Duf 009: resize . . . 6000ns Duf 010: big chain . . . 12ms Duf 012: empty table . . . 6000ns Duf 014: join . . . 8000ns Duf 016: contains . . . 20μs Duf 018: swap . . . 22μs DynamicArray2 001: default constructor with 3 default args . . . 5000ns DynamicArray2 002: default constructor with 2 default args . . . 4000ns DynamicArray2 003: default constructor with 1 default args . . . 5000ns DynamicArray2 004: default constructor with 0 default args . . . 5000ns DynamicArray2 005: copy constructor with 1 default args . . . 5000ns DynamicArray2 006: copy constructor with 0 default args . . . 9000ns DynamicArray2 007: add_rows . . . 8000ns DynamicArray2 008: add_rows . . . 6000ns DynamicArray2 009: add_cols . . . 33μs DynamicArray2 010: set/get . . . 27μs DynamicArray2 011: append 1/2 . . . 77μs DynamicArray2 012: append 2/2 . . . 117μs DynamicArray2 013: count . . . 10μs DynamicArray2 014: clear . . . 5000ns DynamicArray2 015: begin_row and end_row . . . 33μs DynamicArray2 016: cbegin_row and cend_row . . . 15μs DynamicArray2 017: iterator operator++ (postfix) . . . 178μs DynamicArray2 018: iterator operator++ (prefix) . . . 1087μs DynamicArray2 019: iterator operator-- (postfix) . . . 238μs DynamicArray2 020: iterator operator-- (prefix) . . . 239μs DynamicArray2 021: operator= . . . 8000ns DynamicArray2 022: operator== and operator!= . . . 214μs DynamicArray2 023: empty and clear . . . 7000ns DynamicArray2 024: max_size . . . 4000ns DynamicArray2 025: swap . . . 33μs DynamicArray2 026: iterator arithmetic . . . 963μs DynamicArray2 027: iterator comparison . . . 7000ns DynamicArray2 028: iterator operator= . . . 5000ns DynamicArray2 029: iterator operator[] . . . 46μs DynamicArray2 030: iterator operator-> . . . 18μs DynamicArray2 031: const_iterator operator++/-- . . . 150μs DynamicArray2 032: const_iterator operator++/-- . . . 4000ns DynamicArray2 033: column iterators . . . 13μs DynamicArray2 034: column iterator arithmetic . . . 3605μs DynamicArray2 035: iterator assignment constructor . . . 967μs DynamicArray2 036: reserve method . . . 48μs DynamicArray2 037: erase column . . . 9000ns DynamicArray2 038: swap_rows . . . 6000ns DynamicArray2 039: apply_row_permutation . . . 6000ns DynamicArray2 040: swap . . . 6000ns DynamicArray2 041: shrink_rows_to . . . 10μs DynamicArray2 042: shrink_rows_to - for range . . . 9000ns FastestBMat 046: check no throw . . . 243μs FelschTree 000: previously failing example . . . 18μs Forest 001: test forest . . . 43μs FpSemigroup 001: Renner monoid type B2 (E. G. presentation), q = 1 . . . 644μs FpSemigroup 002: Renner monoid type B2 (E. G. presentation), q = 0 . . . 574μs FpSemigroup 003: Renner monoid type B3 (E. G. presentation), q = 1 . . . 73ms FpSemigroup 004: Renner monoid type B3 (E. G. presentation), q = 0 . . . 73ms FpSemigroup 005: Renner monoid type B2 (Gay-Hivert presentat [...] . . . 644μs FpSemigroup 006: Renner monoid type B2 (Gay-Hivert presentat [...] . . . 547μs FpSemigroup 007: Renner monoid type B3 (Gay-Hivert presentat [...] . . . 3018μs FpSemigroup 008: Renner monoid type B3 (Gay-Hivert presentat [...] . . . 3066μs FpSemigroup 009: Renner monoid type B4 (Gay-Hivert presentat [...] . . . 165ms FpSemigroup 010: Renner monoid type B4 (Gay-Hivert presentat [...] . . . 240ms FpSemigroup 013: Renner monoid type D2 (E. G. presentation), q = 1 . . . 804μs FpSemigroup 014: Renner monoid type D2 (E. G. presentation), q = 0 . . . 673μs FpSemigroup 015: Renner monoid type D3 (E. G. presentation), q = 1 . . . 3417μs FpSemigroup 016: Renner monoid type D3 (E. G. presentation), q = 0 . . . 3443μs FpSemigroup 017: Renner monoid type D4 (E. G. presentation), q = 1 . . . 1312ms FpSemigroup 018: Renner monoid type D4 (E. G. presentation), q = 0 . . . 1309ms FpSemigroup 019: Renner monoid type D2 (Gay-Hivert presentat [...] . . . 721μs FpSemigroup 020: Renner monoid type D2 (Gay-Hivert presentat [...] . . . 647μs FpSemigroup 021: Renner monoid type D3 (Gay-Hivert presentat [...] . . . 3350μs FpSemigroup 022: Renner monoid type D3 (Gay-Hivert presentat [...] . . . 3308μs FpSemigroup 023: Renner monoid type D4 (Gay-Hivert presentat [...] . . . 68ms FpSemigroup 024: Renner monoid type D4 (Gay-Hivert presentat [...] . . . 77ms FpSemigroup 029: Rook monoid R5, q = 0 . . . 4604μs FpSemigroup 030: Rook monoid R5, q = 1 . . . 4735μs FpSemigroup 031: Rook monoid R6, q = 0 . . . 35ms FpSemigroup 032: Rook monoid R6, q = 1 . . . 35ms FpSemigroup 033: normal_form . . . 179μs FpSemigroup 034: for a finite semigroup . . . 1138μs FpSemigroup 035: finite fp semigroup, dihedral group of order 6 . . . 315μs FpSemigroup 036: finite fp semigroup, size 16 . . . 414μs FpSemigroup 037: finite fp semigroup, size 16 . . . 1120μs FpSemigroup 038: fp semigroup, size 240 . . . 581μs FpSemigroup 039: add_rule . . . 128μs FpSemigroup 040: add_rule . . . 69μs FpSemigroup 041: equal_to . . . 131μs FpSemigroup 042: cbegin/cend_rules . . . 29μs FpSemigroup 043: semigroup of size 3 . . . 228μs FpSemigroup 044: run_for/until . . . 2413μs FpSemigroup 045: constructors . . . 153μs FpSemigroup 046: set_inverses . . . 84μs FpSemigroup 047: smalloverlap . . . 6834μs FpSemigroup 048: quaternion group Q8 . . . 289μs FpSemigroup 049: symmetric group Coxeter presentation . . . 35ms FpSemigroupByPairs 029: (fpsemi) 2-sided congruence on finit [...] . . . 416μs FpSemigroupByPairs 030: (fpsemi) 2-sided congruence on finit [...] . . . 382μs FpSemigroupInterface 000: run with no alphabet . . .  -- with ToddCoxeter 26μs  -- with KnuthBendix 12μs  -- with FpSemigroup 18μs FpSemigroupInterface 001: equal_to . . .  -- with ToddCoxeter and human readable alphabet 1123μs  -- with KnuthBendix and human readable alphabet 3515μs  -- with FpSemigroup and human readable alphabet 3012μs  -- with FpSemigroupByPairs 2412μs FpSemigroupInterface 002: normal_form . . .  -- with ToddCoxeter 112μs  -- with KnuthBendix 136μs  -- with FpSemigroup 259μs FpSemigroupInterface 003: set_alphabet (1/2) . . .  -- with ToddCoxeter 43μs  -- with KnuthBendix 31μs  -- with FpSemigroup 35μs FpSemigroupInterface 004: set_alphabet (2/2) . . . 1087μs FpSemigroupInterface 005: add_rule after finished . . .  -- with ToddCoxeter and human readable alphabet 81μs  -- with KnuthBendix and human readable alphabet 92μs  -- with FpSemigroup and human readable alphabet 271μs  -- with FpSemigroupByPairs 1117μs FpSemigroupInterface 006: add_rule with equal words (1/2) . . .  -- with ToddCoxeter and human readable alphabet 112μs  -- with KnuthBendix and human readable alphabet 158μs  -- with FpSemigroup and human readable alphabet 199μs  -- with FpSemigroupByPairs 108μs FpSemigroupInterface 007: add_rule with equal words (2/2) . . .  -- with ToddCoxeter 13μs  -- with KnuthBendix 11μs  -- with FpSemigroup 15μs FpSemigroupInterface 008: add_rule with word_type . . .  -- with ToddCoxeter 23μs  -- with KnuthBendix 18μs  -- with FpSemigroup 44μs FpSemigroupInterface 009: add_rule with empty word (1/2) . . .  -- with ToddCoxeter 15μs  -- with FpSemigroup 18μs FpSemigroupInterface 010: add_rule with empty word (1/2) . . . 7000ns FpSemigroupInterface 011: add_rules (1/3) . . .  -- with ToddCoxeter 191μs  -- with KnuthBendix 15μs  -- with FpSemigroup 20μs FpSemigroupInterface 012: add_rules (2/3) . . . 254μs FpSemigroupInterface 013: add_rules (3/3) . . .  -- with ToddCoxeter 15μs  -- with KnuthBendix 13μs  -- with FpSemigroup 40μs FpSemigroupInterface 014: set_identity (1/3) . . .  -- with ToddCoxeter 47μs  -- with KnuthBendix 39μs  -- with FpSemigroup 81μs FpSemigroupInterface 015: set_identity (2/3) . . . 134μs FpSemigroupInterface 016: set_identity (3/3) . . .  -- with ToddCoxeter 30μs  -- with KnuthBendix 28μs  -- with FpSemigroup 59μs FpSemigroupInterface 017: identity . . .  -- with ToddCoxeter 14μs  -- with KnuthBendix 10μs  -- with FpSemigroup 15μs FpSemigroupInterface 018: set_inverses + inverses (1/2) . . .  -- with ToddCoxeter 60μs  -- with KnuthBendix 57μs  -- with FpSemigroup 94μs FpSemigroupInterface 019: set_inverses + inverses (2/2) . . . 154μs FpSemigroupInterface 020: is_obviously_infinite (1/2) . . .  -- with ToddCoxeter 94μs  -- with KnuthBendix 119μs  -- with FpSemigroup 291μs FpSemigroupInterface 021: is_obviously_infinite (2/2) . . . 20μs FpSemigroupInterface 022: is_obviously_finite (1/2) . . .  -- with ToddCoxeter 91μs  -- with KnuthBendix 109μs  -- with FpSemigroup 224μs FpSemigroupInterface 023: is_obviously_finite (2/2) . . . 17μs FpSemigroupInterface 024: to_gap_string (1/3) . . .  -- with ToddCoxeter 17μs  -- with KnuthBendix 14μs  -- with FpSemigroup 46μs FpSemigroupInterface 025: to_gap_string (2/3) . . . 8000ns FpSemigroupInterface 026: to_gap_string (3/3) . . . 15μs FroidurePin 016: (BMat8) exception zero generators given . . . 87μs FroidurePin 017: (BMat8) exception word_to_element . . . 114μs FroidurePin 018: (BMat8) exception prefix . . . 1178μs FroidurePin 019: (BMat8) exception suffix . . . 12μs FroidurePin 020: (BMat8) exception first_letter . . . 1177μs FroidurePin 021: (BMat8) exception final_letter . . . 11μs FroidurePin 022: (BMat8) exception current_length . . . 1151μs FroidurePin 023: (BMat8) exception product_by_reduction . . . 760μs FroidurePin 024: (BMat8) exception fast_product . . . 782μs FroidurePin 025: (BMat8) exception is_idempotent . . . 4294ms FroidurePin 026: (BMat8) copy constructor . . .  -- with fully enumerated 4294ms  -- with partially enumerated 4294ms  -- with not enumerated 4294ms FroidurePin 027: (BMat8) cbegin/end_rules . . . 41μs FroidurePin 031: (integers) . . . 267μs FroidurePin 039: (pairs of integers) non-trivial user type . . . 144μs FroidurePin 055: (tropical max-plus semiring matrices) . . . 301μs FroidurePin 061: projective max plus matrix . . . 1021μs FroidurePin 062: projective max plus matrix . . . 20μs FroidurePin> 009: small example 2 . . . 91μs FroidurePin> 005: small example 1 . . . 76μs FroidurePin> 007: regular bmat monoid 4 . . . 68ms FroidurePin> 011: small example 3 . . . 508μs FroidurePin> 006: small example 1 . . . 101μs FroidurePin> 008: regular bmat monoid 4 . . . 84ms FroidurePin> 010: small example 2 . . . 30μs FroidurePin> 012: small example 3 . . . 591μs FroidurePin 000: small example 1 . . . 103μs FroidurePin 001: default constructed . . . 86μs FroidurePin 002: small example 2 . . . 34μs FroidurePin 004: exception: is_idempotent . . . 87μs FroidurePin> 033: Example 000 . . . 5765μs FroidurePin> 035: Example 001 . . . 28μs FroidurePin> 032: Example 000 . . . 5444μs FroidurePin> 034: Example 001 . . . 24μs FroidurePin 036: exception: current_position . . . 68μs FroidurePin 037: exception: word_to_element . . . 32μs FroidurePin 038: exception: prefix, suffix, first_letter . . . 10ms FroidurePin> 040: Example 000 . . . 179μs FroidurePin> 041: Example 000 . . . 39μs FroidurePin> 046: Example 005 . . . 201μs FroidurePin> 047: Example 005 . . . 129μs FroidurePin> 048: Example 005 . . . 131μs FroidurePin> 044: Example 004 . . . 17μs FroidurePin> 045: Example 004 . . . 17μs FroidurePin> 049: Example 006 . . . 771μs FroidurePin> 050: Example 006 . . . 982μs FroidurePin> 051: Example 006 . . . 928μs FroidurePin> 052: Example 007 . . . 102μs FroidurePin> 053: Example 007 . . . 127μs FroidurePin> 054: Example 007 . . . 128μs FroidurePin 056: example 1 . . . 124μs FroidurePin 057: example 2 . . . 110μs FroidurePin> 058: . . . 476μs FroidurePin> 059: . . . 35μs FroidurePin> 060: exceptions: add_generator(s) . . . 37μs FroidurePin> 065: no exception zero generators given . . . 8000ns FroidurePin> 066: exception generators of different [...] . . . 302μs FroidurePin> 067: exception current_position . . . 23μs FroidurePin> 068: exception word_to_element . . . 22μs FroidurePin> 069: exception gens . . . 460μs FroidurePin> 070: exception prefix . . . 12ms FroidurePin> 071: exception suffix . . . 32ms FroidurePin> 072: exception first_letter . . . 31μs FroidurePin> 073: exception final_letter . . . 23μs FroidurePin> 074: exception current_length . . . 23μs FroidurePin> 075: exception product_by_reduction . . . 192μs FroidurePin> 076: exception fast_product . . . 190μs FroidurePin> 077: exception current_position . . . 465μs FroidurePin> 078: exception is_idempotent . . . 472μs FroidurePin> 079: exception add_generators . . . 19μs FroidurePin> 080: multithread number_of_idempotents . . . 406μs FroidurePin> 081: small semigroup . . . 18μs FroidurePin> 082: large semigroup . . . 6012μs FroidurePin> 083: at, position, current_* . . . 6080μs FroidurePin> 084: run . . . 5766μs FroidurePin> 085: run [many stops and starts] . . . 5855μs FroidurePin> 086: factorisation, length [1 element] . . . 5811μs FroidurePin> 087: factorisation, products [all elements] . . . 7317μs FroidurePin> 088: first/final letter, prefix, suffi [...] . . . 5826μs FroidurePin> 089: current_position [standard] . . . 17μs FroidurePin> 090: current_position [duplicate gens] . . . 10ms FroidurePin> 091: current_position [after add_generators] . . . 6253μs FroidurePin> 092: cbegin_idempotents/cend [1 thread] . . . 6431μs FroidurePin> 093: idempotent_cend/cbegin [1 thread] . . . 6479μs FroidurePin> 094: is_idempotent [1 thread] . . . 6202μs FroidurePin> 096: finished, started . . . 5825μs FroidurePin> 097: current_position . . . 1255μs FroidurePin> 098: sorted_position, sorted_at . . . 7121μs FroidurePin> 099: right/left Cayley graph . . . 30ms FroidurePin> 100: iterator . . . 9106μs FroidurePin> 101: reverse iterator . . . 9028μs FroidurePin> 102: iterator arithmetic . . . 23ms FroidurePin> 103: iterator sorted . . . 24ms FroidurePin> 104: iterator sorted arithmetic . . . 26ms FroidurePin> 105: copy [not enumerated] . . . 5959μs FroidurePin> 106: copy_closure [not enumerated] . . . 37ms FroidurePin> 107: copy_add_generators [not enumerated] . . . 35ms FroidurePin> 108: copy [partly enumerated] . . . 6465μs FroidurePin> 109: copy_closure [partly enumerated] . . . 9803μs FroidurePin> 110: copy_add_generators [partly enumerated] . . . 6503μs FroidurePin> 111: copy [fully enumerated] . . . 8887μs FroidurePin> 112: copy_closure [fully enumerated] . . . 9823μs FroidurePin> 113: copy_add_generators [fully enumerated] . . . 9115μs FroidurePin> 114: relations [duplicate gens] . . . 134μs FroidurePin> 115: relations . . . 7852μs FroidurePin> 116: relations [copy_closure, duplicat [...] . . . 10ms FroidurePin> 117: relations [copy_add_generators, d [...] . . . 10ms FroidurePin> 118: relations [from copy, not enumerated] . . . 6852μs FroidurePin> 119: relations [from copy, partly enum [...] . . . 12ms FroidurePin> 120: relations [from copy, fully enumerated] . . . 11ms FroidurePin> 121: relations [from copy_closure, not [...] . . . 11ms FroidurePin> 122: relations [from copy_add_generato [...] . . . 6869μs FroidurePin> 123: relations [from copy_closure, par [...] . . . 10ms FroidurePin> 124: relations [from copy_add_generato [...] . . . 8392μs FroidurePin> 125: relations [from copy_closure, ful [...] . . . 11ms FroidurePin> 126: relations [from copy_add_generato [...] . . . 10ms FroidurePin> 127: add_generators [duplicate generators] . . . 267μs FroidurePin> 128: add_generators [incremental 1] . . . 273μs FroidurePin> 129: add_generators [incremental 2] . . . 345μs FroidurePin> 130: closure [duplicate generators] . . . 153μs FroidurePin> 131: closure . . . 72μs FroidurePin> 132: factorisation . . . 14μs FroidurePin> 134: minimal_factorisation . . . 29μs FroidurePin> 135: batch_size (for an extremely larg [...] . . . 13μs FroidurePin> 137: exception: generators of differen [...] . . . 14μs FroidurePin> 138: exception: current_position . . . 24μs FroidurePin> 139: exception: word_to_element . . . 23μs FroidurePin> 140: exception: gens, current_position . . . 444μs FroidurePin> 141: exception: add_generators . . . 16μs KBE 000: constructors . . . 26μs KBE 001: test . . . 44μs KBE 002: factorisation . . . 32μs KBE 003: swap . . . 21μs KBE 004: adapters . . . 20μs KBE 005: conversions . . . 20μs Kambites 000: (fpsemi) MT test 4 (std::string) . . . 6541μs Kambites 001: (fpsemi) MT test 4 (MultiStringView) . . . 6488μs Kambites 002: (fpsemi) number_of_pieces (std::string) . . . 82μs Kambites 003: (fpsemi) number_of_pieces (MultiStringView) . . . 62μs Kambites 004: (fpsemi) small_overlap_class (std::string) . . . 2412μs Kambites 005: (fpsemi) small_overlap_class (MultiStringView) . . . 2399μs Kambites 006: (fpsemi) random (std::string) . . . 10ms Kambites 007: (fpsemi) random (MultiStringView) . . . 10ms Kambites 008: (fpsemi) KnuthBendix 055 (std::string) . . . 16ms Kambites 009: (fpsemi) KnuthBendix 055 (MultiStringView) . . . 17ms Kambites 010: (fpsemi) smalloverlap/gap/test.gi:85 (std::string) . . . 57μs Kambites 011: (fpsemi) smalloverlap/gap/test.gi:85 (MultiStr [...] . . . 50μs Kambites 012: (fpsemi) free semigroup . . . 7000ns Kambites 013: (fpsemi) smalloverlap/gap/test.gi:49 (std::string) . . . 36ms Kambites 014: (fpsemi) smalloverlap/gap/test.gi:49 (MultiStr [...] . . . 41ms Kambites 015: (fpsemi) smalloverlap/gap/test.gi:63 (std::string) . . . 38ms Kambites 016: (fpsemi) smalloverlap/gap/test.gi:63 (MultiStr [...] . . . 46ms Kambites 017: (fpsemi) smalloverlap/gap/test.gi:70 (std::string) . . . 136ms Kambites 018: (fpsemi) smalloverlap/gap/test.gi:70 (MultiStr [...] . . . 168ms Kambites 021: (fpsemi) code coverage (std::string) . . . 30μs Kambites 022: (fpsemi) code coverage (MultiStringView) . . . 18μs Kambites 023: (fpsemi) prefix (std::string) . . . 48μs Kambites 024: (fpsemi) prefix (MultiStringView) . . . 72μs Kambites 025: (fpsemi) normal_form (Example 3.15) (std::string) . . . 49μs Kambites 026: (fpsemi) normal_form (Example 3.15) (MultiStri [...] . . . 75μs Kambites 027: (fpsemi) normal_form (Example 3.16) (std::string) . . . 42μs Kambites 028: (fpsemi) normal_form (Example 3.16) (MultiStri [...] . . . 52μs Kambites 029: (fpsemi) normal_form (Example 3.16) more exhau [...] . . . 64ms Kambites 030: (fpsemi) normal_form (Example 3.16) more exhau [...] . . . 72ms Kambites 031: (fpsemi) small presentation (std::string) . . . 41μs Kambites 032: (fpsemi) small presentation (MultiStringView) . . . 25μs Kambites 033: (fpsemi) non-smalloverlap (std::string) . . . 29μs Kambites 034: (fpsemi) non-smalloverlap (MultiStringView) . . . 29μs Kambites 035: (fpsemi) MT test 3 (std::string) . . . 31μs Kambites 036: (fpsemi) MT test 3 (MultiStringView) . . . 33μs Kambites 037: (fpsemi) MT test 5 (std::string) . . . 32μs Kambites 038: (fpsemi) MT test 5 (MultiStringView) . . . 33μs Kambites 039: (fpsemi) MT test 6 (std::string) . . . 26μs Kambites 040: (fpsemi) MT test 6 (MultiStringView) . . . 32μs Kambites 041: (fpsemi) MT test 10 (std::string) . . . 23μs Kambites 042: (fpsemi) MT test 10 (MultiStringView) . . . 30μs Kambites 043: (fpsemi) MT test 13 (std::string) . . . 16μs Kambites 044: (fpsemi) MT test 13 (MultiStringView) . . . 18μs Kambites 045: (fpsemi) MT test 14 (std::string) . . . 15μs Kambites 046: (fpsemi) MT test 14 (MultiStringView) . . . 17μs Kambites 047: (fpsemi) MT test 15 (std::string) . . . 23μs Kambites 048: (fpsemi) MT test 15 (MultiStringView) . . . 23μs Kambites 049: (fpsemi) MT test 16 (std::string) . . . 23μs Kambites 050: (fpsemi) MT test 16 (MultiStringView) . . . 26μs Kambites 051: (fpsemi) MT test 17 (std::string) . . . 82μs Kambites 052: (fpsemi) MT test 17 (MultiStringView) . . . 74μs Kambites 053: (fpsemi) weak C(4) not strong x 1 (std::string) . . . 434μs Kambites 054: (fpsemi) weak C(4) not strong x 1 (MultiStringView) . . . 579μs Kambites 055: (fpsemi) weak C(4) not strong x 2 (std::string) . . . 450μs Kambites 056: (fpsemi) weak C(4) not strong x 2 (MultiStringView) . . . 572μs Kambites 057: (fpsemi) weak C(4) not strong x 3 (std::string) . . . 399μs Kambites 058: (fpsemi) weak C(4) not strong x 3 (MultiStringView) . . . 382μs Kambites 059: (fpsemi) weak C(4) not strong x 4 (std::string) . . . 40μs Kambites 060: (fpsemi) weak C(4) not strong x 4 (MultiStringView) . . . 57μs Kambites 061: (fpsemi) weak C(4) not strong x 5 (std::string) . . . 18μs Kambites 062: (fpsemi) weak C(4) not strong x 5 (MultiStringView) . . . 15μs Kambites 063: (fpsemi) weak C(4) not strong x 6 (std::string) . . . 23μs Kambites 064: (fpsemi) weak C(4) not strong x 6 (MultiStringView) . . . 26μs Kambites 065: (fpsemi) Konovalov example (std::string) . . . 13μs Kambites 066: (fpsemi) Konovalov example (MultiStringView) . . . 13μs Kambites 067: (fpsemi) long words (std::string) . . . 1904ms Kambites 068: (fpsemi) long words (MultiStringView) . . . 42ms Kambites 075: (cong) example 1 . . . 44μs Kambites 076: (cong) example 2 . . . 75μs Kambites 077: (cong) code coverage . . . 6322μs Kambites 078: (cong) large number of rules . . . 219ms KnuthBendix 000: (fpsemi) confluent fp semigroup 1 (infinite) . . . 80μs KnuthBendix 001: (fpsemi) confluent fp semigroup 2 (infinite) . . . 135μs KnuthBendix 002: (fpsemi) confluent fp semigroup 3 (infinite) . . . 61μs KnuthBendix 003: (fpsemi) non-confluent fp semigroup from wi [...] . . . 126μs KnuthBendix 004: (fpsemi) Example 5.1 in Sims (infinite) . . . 98μs KnuthBendix 005: (fpsemi) Example 5.1 in Sims (infinite) . . . 90μs KnuthBendix 006: (fpsemi) Example 5.3 in Sims . . . 78μs KnuthBendix 007: (fpsemi) Example 5.4 in Sims . . . 89μs KnuthBendix 008: (fpsemi) Example 6.4 in Sims (size 168) . . . 6053μs KnuthBendix 009: (fpsemi) . . . 34ms KnuthBendix 010: (fpsemi) SL(2, 7) from Chapter 3, Propositi [...] . . . 58ms KnuthBendix 011: (fpsemi) F(2, 5) - Chapter 9, Section 1 in [...] . . . 339μs KnuthBendix 012: (fpsemi) Reinis example 1 . . . 148μs KnuthBendix 013: redundant_rule (std::string) . . . 100ms KnuthBendix 014: redundant_rule (word_type) . . . 10ms KnuthBendix 019: (fpsemi) C(4) monoid . . . 157μs KnuthBendix 020: (cong) Chinese monoid . . . 165μs KnuthBendix 021: (from kbmag/standalone/kb_data/f25monoid) . . . 370μs KnuthBendix 022: (from kbmag/standalone/kb_data/degen4a) . . . 34ms KnuthBendix 023: (from kbmag/standalone/kb_data/torus) . . . 2550μs KnuthBendix 024: (from kbmag/standalone/kb_data/3a6) . . . 178ms KnuthBendix 025: (from kbmag/standalone/kb_data/f2) . . . 34μs KnuthBendix 026: (from kbmag/standalone/kb_data/s16) . . . 71ms KnuthBendix 027: (from kbmag/standalone/kb_data/a4monoid) . . . 42μs KnuthBendix 028: (from kbmag/standalone/kb_data/degen3) . . . 15μs KnuthBendix 029: (from kbmag/standalone/kb_data/ab1) . . . 13μs KnuthBendix 030: (from kbmag/standalone/kb_data/degen2) . . . 9000ns KnuthBendix 031: (from kbmag/standalone/kb_data/f25) . . . 333μs KnuthBendix 032: (from kbmag/standalone/kb_data/237) . . . 447μs KnuthBendix 033: (from kbmag/standalone/kb_data/c2) . . . 9000ns KnuthBendix 034: (from kbmag/standalone/kb_data/cosets) . . . 168μs KnuthBendix 035: Example 5.1 in Sims (KnuthBendix 09 again) . . . 37μs KnuthBendix 036: (from kbmag/standalone/kb_data/nilp2) . . . 27μs KnuthBendix 037: Example 6.4 in Sims . . . 9652μs KnuthBendix 038: KnuthBendix 071 again . . . 537μs KnuthBendix 039: Example 5.4 in Sims (KnuthBendix 11 again) [...] . . . 151μs KnuthBendix 040: Example 5.4 in Sims (KnuthBendix 11 again) [...] . . . 109μs KnuthBendix 041: operator<< . . . 79μs KnuthBendix 042: confluence_interval . . . 10μs KnuthBendix 043: max_overlap . . . 9000ns KnuthBendix 044: (fpsemi) (from kbmag/standalone/kb_data/d22 [...] . . . 976μs KnuthBendix 045: (fpsemi) (from kbmag/standalone/kb_data/d22 [...] . . . 1745μs KnuthBendix 046: (fpsemi) small example . . . 576μs KnuthBendix 047: code coverage . . . 37μs KnuthBendix 048: small overlap 1 . . . 41μs KnuthBendix 049: (from kbmag/standalone/kb_data/s9) . . . 1183μs KnuthBendix 050: (fpsemi) Chapter 11, Lemma 1.8 (q = 6, r = [...] . . . 506μs KnuthBendix 051: (fpsemi) Chapter 11, Section 2 (q = 6, r = [...] . . . 89μs KnuthBendix 052: (fpsemi) Chapter 8, Theorem 4.2 in NR (infinite) . . . 185μs KnuthBendix 053: (fpsemi) equal_to fp semigroup . . . 47μs KnuthBendix 054: (fpsemi) equal_to free semigroup . . . 29μs KnuthBendix 055: (fpsemi) from GAP smalloverlap gap/test.gi [...] . . . 294μs KnuthBendix 056: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 479μs KnuthBendix 057: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 487μs KnuthBendix 058: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 1476μs KnuthBendix 059: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 3189μs KnuthBendix 060: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 24μs KnuthBendix 061: (fpsemi) Von Dyck (2,3,7) group (infinite) . . . 416μs KnuthBendix 062: (fpsemi) Von Dyck (2,3,7) group - different [...] . . . 3258μs KnuthBendix 063: (fpsemi) rewriting system from KnuthBendixC [...] . . . 318μs KnuthBendix 064: (fpsemi) rewriting system from Congruence 20 . . . 25μs KnuthBendix 065: (fpsemi) (from kbmag/standalone/kb_data/ab2) . . . 71μs KnuthBendix 066: (fpsemi) (from kbmag/standalone/kb_data/d22 [...] . . . 1018μs KnuthBendix 067: (fpsemi) (from kbmag/standalone/kb_data/degen1) . . . 23μs KnuthBendix 068: (fpsemi) (from kbmag/standalone/kb_data/s4) . . . 247μs KnuthBendix 069: (fpsemi) fp semigroup (infinite) . . . 39μs KnuthBendix 070: (fpsemi) Chapter 11, Section 1 (q = 4, r = [...] . . . 1374μs KnuthBendix 071: (fpsemi) Chapter 11, Section 1 (q = 8, r = [...] . . . 72ms KnuthBendix 072: (fpsemi) Chapter 7, Theorem 3.9 in NR (size 240) . . . 2556μs KnuthBendix 073: (fpsemi) F(2, 5) - Chapter 9, Section 1 in [...] . . . 343μs KnuthBendix 074: (fpsemi) F(2, 6) - Chapter 9, Section 1 in NR . . . 360μs KnuthBendix 075: (fpsemi) Chapter 10, Section 4 in NR (infinite) . . . 704μs KnuthBendix 076: (fpsemi) Sym(5) from Chapter 3, Proposition [...] . . . 2257μs KnuthBendix 077: (fpsemi) SL(2, 7) from Chapter 3, Propositi [...] . . . 57ms KnuthBendix 078: (fpsemi) bicyclic monoid (infinite) . . . 30μs KnuthBendix 079: (fpsemi) plactic monoid of degree 2 (infinite) . . . 46μs KnuthBendix 080: (fpsemi) example before Chapter 7, Proposit [...] . . . 27μs KnuthBendix 081: (fpsemi) Chapter 7, Theorem 3.6 in NR (size 243) . . . 628μs KnuthBendix 082: (fpsemi) finite semigroup (size 99) . . . 189μs KnuthBendix 096: Sorouhesh . . . 282μs KnuthBendix 097: (fpsemi) transformation semigroup (size 4) . . . 39μs KnuthBendix 098: (fpsemi) transformation semigroup (size 9) . . . 34μs KnuthBendix 099: (fpsemi) transformation semigroup (size 88) . . . 535μs KnuthBendix 100: internal_string_to_word . . . 24μs KnuthBendix 101: (fpsemi) construct from shared_ptr . . . 552μs KnuthBendix 102: internal_string_to_word . . . 651μs KnuthBendix 103: (cong) free semigroup congruence (5 classes) . . . 47μs KnuthBendix 104: free semigroup congruence (6 classes) . . . 213μs KnuthBendix 105: (cong) free semigroup congruence (16 classes) . . . 278μs KnuthBendix 106: (cong) free semigroup congruence (6 classes) . . . 416μs KnuthBendix 107: (cong) free semigroup congruence (240 classes) . . . 2642μs KnuthBendix 108: (cong) free semigroup congruence (240 classes) . . . 2394μs KnuthBendix 109: (cong) less . . . 3270μs KnuthBendix 110: (cong) less . . . 133ms KnuthBendix 111: (cong) constructors . . . 203ms KnuthBendix 112: (cong) const_contains/contains . . . 131μs KnuthBendix 113: (cong) is_quotient_obviously_finite . . . 12μs KnuthBendix 114: (cong) class_index_to_word . . . 148μs KnuthBendix 115: (cong) quotient_froidure_pin . . . 109μs KnuthBendix 116: (cong) set_number_of_generators . . . 12μs KnuthBendix 117: (cong) number of classes when obv-inf . . . 43μs KnuthBendixCongruenceByPairs 016: non-trivial congruence on [...] . . . 141μs KnuthBendixCongruenceByPairs 017: non-trivial congruence on [...] . . . 155μs KnuthBendixCongruenceByPairs 018: non-trivial congruence on [...] . . . 283μs KnuthBendixCongruenceByPairs 019: non-trivial congruence on [...] . . . 281μs KnuthBendixCongruenceByPairs 020: trivial congruence on a fi [...] . . . 150μs KnuthBendixCongruenceByPairs 021: universal congruence on a [...] . . . 468μs KnuthBendixCongruenceByPairs 022: left congruence on a finit [...] . . . 212μs KnuthBendixCongruenceByPairs 023: finite group, Chapter 11, [...] . . . 3609μs KnuthBendixCongruenceByPairs 024: right congruence on infini [...] . . . 254μs KnuthBendixCongruenceByPairs 025: finite fp semigroup, dihed [...] . . . 283μs KnuthBendixCongruenceByPairs 026: finite fp semigroup, size 16 . . . 295μs KnuthBendixCongruenceByPairs 027: finite fp semigroup, size 16 . . . 836μs KnuthBendixCongruenceByPairs 028: infinite fp semigroup with [...] . . . 41μs Konieczny 000: test000> . . . 1636μs Konieczny 001: test000> . . . 725μs Konieczny 002: test001> . . . 10ms Konieczny 003: test001> . . . 8673μs Konieczny 006: exceptions . . . 124μs Konieczny 007: code coverage . . . 13ms Konieczny 008: code coverage . . . 11ms Konieczny 009: regular elements and idempotents . . . 4294ms Konieczny 010: regular D-class 01 . . . 1309μs Konieczny 011: regular D-class 02 . . . 31ms Konieczny 012: regular D-class 04: contains . . . 3821ms Konieczny 013: non-regular D-classes 01 . . . 1353μs Konieczny 014: RegularDClass . . . 682μs Konieczny 015: full bmat monoid 4 . . . 420ms Konieczny 017: regular generated bmat monoid 4 idempotents . . . 263ms Konieczny 019: my favourite example . . . 147ms Konieczny 020: another large example . . . 24ms Konieczny 021: my favourite example transposed . . . 289ms Konieczny 024: exceptions . . . 1337μs Konieczny 025: 0-parameter constructor . . . 28ms Konieczny 026: non-regular D-classes 02 . . . 31ms Konieczny 028: partial perm . . . 195ms Konieczny 029: symmetric inverse monoid n = 8 . . . 37ms Konieczny 030: exceptions . . . 242ms Konieczny 031: transformations . . . 1065μs Konieczny 032: transformations - JDM favourite example . . . 143ms Konieczny 033: transformations - large example . . . 352ms Konieczny 034: transformations - large example with stop . . . 351ms Konieczny 035: transformations - large example with run_until . . . 351ms Konieczny 036: transformations - large example with stop in Action . . . 350ms Konieczny 037: exceptions . . . 33μs Konieczny 038: transformations: contains . . . 544μs Konieczny 040: transformations - destructor coverage . . . 293ms Konieczny 041: current_number_D_classes . . . 295ms Konieczny 042: add_generator . . . 31μs Konieczny 043: add_generator . . . 17μs Matrix 000: BMat<2> . . . 292μs Matrix 001: BMat<> . . . 40μs Matrix 002: BMat<3> + BMat<> . . . 6000ns Matrix 003: BMat<2> + BMat<> . . . 6000ns Matrix 004: BMat<3> . . . 6000ns Matrix 005: BMat<> . . . 8000ns Matrix 006: BMat<3> row_basis . . . 20μs Matrix 007: BMat<> row_basis . . . 21μs Matrix 008: IntMat<3> . . . 8000ns Matrix 009: IntMat<> . . . 10μs Matrix 010: IntMat code cov . . . 5000ns Matrix 011: MaxPlusMat<3> . . . 7000ns Matrix 012: MaxPlusMat<> . . . 8000ns Matrix 013: MaxPlusMat code cov . . . 4000ns Matrix 014: MinPlusMat<3> . . . 9000ns Matrix 015: MinPlusMat<> . . . 10μs Matrix 016: MinPlusMat code cov . . . 3000ns Matrix 017: MaxPlusTruncMat<5, 2> . . . 81μs Matrix 018: MaxPlusTruncMat<5> . . . 9000ns Matrix 019: MaxPlusTruncMat<> . . . 16μs Matrix 020: MaxPlusTruncMat<5, 4> . . . 10μs Matrix 021: MaxPlusTruncMat<5> . . . 11μs Matrix 022: MaxPlusTruncMat<> . . . 10μs Matrix 023: MaxPlusTruncMat<33, 3> . . . 15μs Matrix 024: MaxPlusTruncMat<33> . . . 15μs Matrix 025: MaxPlusTruncMat<> . . . 15μs Matrix 026: MaxPlusMat code cov . . . 4000ns Matrix 027: MinPlusTruncMat<33, 3> . . . 15μs Matrix 028: MinPlusTruncMat<33> . . . 17μs Matrix 029: MinPlusTruncMat<> . . . 20μs Matrix 030: NTPMat<0, 3, 3, 3> . . . 8000ns Matrix 031: NTPMat<0, 3> . . . 8000ns Matrix 032: NTPMat<> . . . 20μs Matrix 033: NTPMat<0, 10, 4, 4> . . . 22μs Matrix 034: NTPMat<0, 10> . . . 11μs Matrix 035: NTPMat<> . . . 10μs Matrix 036: NTPMat<0, 10, 4, 4> . . . 11μs Matrix 037: NTPMat<0, 10> . . . 10μs Matrix 038: NTPMat<> . . . 10μs Matrix 039: NTPMat<33, 2, 3, 3> . . . 8000ns Matrix 040: NTPMat<33, 2> . . . 8000ns Matrix 041: NTPMat<> . . . 8000ns Matrix 042: ProjMaxPlusMat<3> . . . 50μs Matrix 043: ProjMaxPlusMat<> . . . 34μs Matrix 044: exceptions . . . 15μs Matrix 045: code coverage . . . 19μs MultiStringView 000: catch all . . . 193μs MultiStringView 001: is_prefix . . . 7000ns MultiStringView 002: erase . . . 8000ns MultiStringView 003: iterators . . . 5000ns MultiStringView 004: constructors (long) . . . 13μs MultiStringView 005: constructors (short) . . . 10μs MultiStringView 006: copy assignment (short assigned to long) . . . 6000ns MultiStringView 007: copy assignment (short assigned to short) . . . 7000ns MultiStringView 008: move assignment (short assigned to long) . . . 6000ns MultiStringView 009: move assignment (short assigned to short) . . . 6000ns MultiStringView 010: code coverage . . . 11μs MultiStringView 011: pop_front . . . 89μs MultiStringView 012: append . . . 7000ns MultiStringView 013: operators . . . 8000ns MultiStringView 014: maximum_common_suffix . . . 7000ns MultiStringView 015: deep tests . . . 4000ns ObviouslyInfinite 011: Multiple rule additions . . . 20μs ObviouslyInfinite 012: A power of the generator 'b' does not [...] . . . 5000ns ObviouslyInfinite 013: Preserves the number of occurrences o [...] . . . 5000ns ObviouslyInfinite 014: Less relations than generators . . . 6000ns ObviouslyInfinite 015: Relations preserve length . . . 6000ns ObviouslyInfinite 016: Matrix has non empty kernel . . . 6000ns ObviouslyInfinite 017: Free product of trivial semigroups . . . 5000ns ObviouslyInfinite 018: Another free product . . . 6000ns ObviouslyInfinite 019: Infinite but not obviously so . . . 6000ns ObviouslyInfinite 020: Finite semigroup . . . 7000ns PBR 001: universal product with convenience constructor . . . 32μs PBR 002: universal product . . . 9000ns PBR 003: product [bigger than previous] . . . 17μs PBR 004: hash . . . 5000ns PBR 005: delete/copy . . . 9000ns PBR 006: exceptions . . . 67μs PBR 007: operators . . . 43μs PBR 008: to_string . . . 10μs PBR 009: identity . . . 25μs PBR 010: adapters . . . 4000ns Pool 000: initial . . . 14μs Pool 001: bmat . . . 12μs Pool 002: PoolGuard . . . 10μs Pool 003: transformation products . . . 7000ns Presentation 000: vectors of ints . . . 30μs Presentation 001: strings . . . 86μs Presentation 002: constructors (word_type) . . . 12μs Presentation 003: constructors (StaticVector1) . . . 83μs Presentation 004: constructors (std::string) . . . 13μs Presentation 005: alphabet + letters (word_type) . . . 104μs Presentation 006: alphabet + letters (std::string) . . . 17μs Presentation 007: contains_empty_word . . . 5000ns Presentation 008: validate_rules throws . . . 19μs Presentation 009: helpers add_rule(s) . . . 39μs Presentation 010: helpers add_rule(s) (std::string) . . . 15μs Presentation 011: helpers add_identity_rules (std::vector/St [...] . . . 19μs Presentation 012: helpers add_identity_rules (std::string) . . . 12μs Presentation 013: helpers add_inverse_rules (all) . . . 88μs Presentation 014: helpers add_inverse_rules (std::string) . . . 40μs Presentation 015: helpers remove_duplicate_rules . . . 27μs Presentation 016: helpers reduce_complements . . . 60μs Presentation 017: helpers sort_each_rule . . . 27μs Presentation 018: helpers sort_rules . . . 28μs Presentation 019: helpers longest_common_subword/replace_subword . . . 152μs Presentation 020: helpers redundant_rule . . . 8580μs Presentation 021: helpers shortlex_compare_concat . . . 6000ns Presentation 022: helpers remove_trivial_rules . . . 38μs Presentation 023: helpers replace_subword (existing, replacement) . . . 61μs Presentation 024: helpers longest_rule . . . 48μs Presentation 025: helpers longest_rule_length . . . 40μs Presentation 026: helpers remove_redundant_generators . . . 72μs Presentation 027: helpers reverse . . . 11μs Presentation 028: in_alphabet . . . 13μs Presentation 029: replace_subword with empty word . . . 9000ns Presentation 030: helpers replace_word . . . 19μs Presentation 031: clear . . . 5000ns Presentation 032: letter . . . 20μs Presentation 033: normalize_alphabet . . . 8000ns Presentation 034: longest_common_subword issue . . . 185μs Presentation 035: helpers add_zero_rules (std::vector/Static [...] . . . 21μs Presentation 036: helpers add_zero_rules (std::string) . . . 12μs Presentation 037: make_semigroup . . . 38μs Presentation 038: greedy_reduce_length . . . 110μs Presentation 039: aaaaaaaab = aaaaaaaaab strong compression . . . 32μs Presentation 040: change_alphabet . . . 33μs Presentation 041: sort_rules bug . . . 193μs Presentation 042: first_unused_letter/letter . . . 120μs Presentation 043: case where strong compression doesn't work . . . 18μs Presentation 044: proof that . . . 22μs Presentation 045: decompression . . . 10μs Race 001: run_for . . . 10ms Race 002: run_until . . . 10ms Race 003: exceptions . . . 10ms Race 004: iterators . . . 7000ns Race 005: find_runner . . . 7000ns Race 006: run_func . . . 25ms Race 007: run_func . . . 10ms Race 008: run_func . . . 10ms Runner 000: run_for . . . 10ms Runner 001: run_for . . . 1006μs Runner 002: run_for . . . 191ms Runner 003: run_for . . . 25ms Runner 004: started . . . 1006μs Runner 005: run_until . . . 30ms Runner 006: kill . . . 5000ns Runner 007: copy constructor . . . 10ms Runner 008: report . . . 20ms Runner 009: run_until with function pointer . . . 5000ns SchreierSims 001: trivial perm. group (degree 1) . . . 67μs SchreierSims 002: trivial perm. group (degree 2) . . . 84μs SchreierSims 003: trivial perm. group (degree 500) . . . 93μs SchreierSims 004: symmetric perm. group (degree 5) . . . 13μs SchreierSims 005: symmetric perm. group (degree 8) . . . 24μs SchreierSims 006: symmetric perm. group (degree 9) . . . 34μs SchreierSims 007: alternating perm. group (degree 12) . . . 128μs SchreierSims 008: symmetric perm. group (degree 16) . . . 526μs SchreierSims 009: alternating perm. group (degree 15) . . . 269μs SchreierSims 010: alternating perm. group (degree 16) . . . 599μs SchreierSims 011: dihedral perm. group (order 10) . . . 7000ns SchreierSims 012: dihedral perm. group (order 200) . . . 777μs SchreierSims 013: perm. group T (order 12) . . . 8000ns SchreierSims 014: quaternion perm. group (order 8) . . . 10μs SchreierSims 015: perm. group (order 84129611558952960) . . . 237ms SchreierSims 016: perm. group SL(3, 5) (order 372000) . . . 990μs SchreierSims 017: perm. group PSL(4, 8) (order 34558531338240) . . . 93ms SchreierSims 018: perm. Mathieu group M11 (order 7920) . . . 183μs SchreierSims 019: perm. Mathieu group M24 (order 244823040) . . . 182μs SchreierSims 020: perm. Janko Group J1 (order 175560) . . . 2119μs SchreierSims 021: perm. Hall-Janko group (order 604800) . . . 308μs SchreierSims 022: perm. Hall-Janko group (alt.) (order 604800) . . . 19ms SchreierSims 023: perm. Conway group Co3 (order 495766656000) . . . 6523μs SchreierSims 024: perm. Conway group Co3 (alt.) (order 49576 [...] . . . 13ms SchreierSims 025: perm. Suzuki group (order 448345497600) . . . 67ms SchreierSims 027: perm. Held group (order 4030387200) . . . 134ms SchreierSims 028: perm. group C2 x C2 x C2 (order 8) . . . 18μs SchreierSims 029: perm. group C2 x C2 x C2 x C2 (order 16) . . . 20μs SchreierSims 030: perm. group (S5 x S5) : C2 (order 28800) . . . 48μs SchreierSims 031: perm. group C3 x D8 x A5 (order 1440) . . . 57μs SchreierSims 032: perm. group GL(4, 3) (order 24261120) . . . 590μs SchreierSims 033: perm. group PSL(3, 7) (order 1876896) . . . 652μs SchreierSims 037: symmetric perm. group (degree 5) . . . 18μs SchreierSims 038: alternating perm. group (degree 17) . . . 3059μs SchreierSims 039: exceptions . . . 46μs SchreierSims 040: exceptions . . . 22μs SchreierSims 041: trivial group . . . 17μs SchreierSims 042: A17 bug . . . 2727μs SchreierSims 043: orbits_lookup test . . . 398μs SchreierSims 044: transversal_element and inversal_element test . . . 710μs SchreierSimsHelper 001: trivial perm. group intersection (de [...] . . . 74μs SchreierSimsHelper 002: trivial perm. group intersection (de [...] . . . 81μs SchreierSimsHelper 003: cyclic group intersection (degree 13) . . . 21μs SchreierSimsHelper 004: D10 and Z5 intersection . . . 18μs SchreierSimsHelper 005: D8 and Q8 intersection . . . 16μs SchreierSimsHelper 006: primitive on 8 points intersection . . . 55μs SchreierSimsHelper 007: primitive on 8 points intersection ( [...] . . . 52μs SchreierSimsHelper 008: A13 and PGL(2, 11) intersection . . . 497μs SchreierSimsHelper 009: A13 and PGL(2, 11) intersection (swa [...] . . . 492μs SchreierSimsHelper 012: 3^3:13 and 3^3.2.A(4) intersection . . . 220μs SchreierSimsHelper 015: 3^3(S(4) x 2) and ASL(3, 3) intersection . . . 282μs SchreierSimsHelper 016: 7^2:3 x Q(8) and 7^2:D(2*6) intersection . . . 320μs SchreierSimsHelper 018: D(2*53) and 53:13 intersection . . . 184μs SchreierSimsHelper 019: 2^6:(7 x D_14) and PSL(2, 6)^2.4 int [...] . . . 1699μs SchreierSimsHelper 020: 2^6:(S_3 x GL(3, 2)) and 2.6:Alt(7) [...] . . . 5552μs SchreierSimsHelper 022: PSL(2, 127) and AGL(1, 2^7) intersection . . . 10ms SchreierSimsHelper 023: PSL(3, 4).2 and PSL(3, 4).2 (nontriv [...] . . . 1669μs SchreierSimsHelper 024: PSL(3, 4).Sym(3) and PSL(3, 4).2 int [...] . . . 2188μs SchreierSimsHelper 025: 3^4:5:4 and D_16:4 intersection . . . 1010μs Sims1 000: fp example 1 . . . 814μs Sims1 001: fp example 2 . . . 1486μs Sims1 002: ToddCoxeter failing example . . . 13ms Sims1 003: ToddCoxeter failing example . . . 622μs Sims1 004: partition_monoid(2) right . . . 4908μs Sims1 006: full_transformation_monoid(3) right . . . 5955μs Sims1 007: full_transformation_monoid(3) left . . . 3183μs Sims1 009: rook_monoid(2, 1) . . . 67μs Sims1 010: symmetric_inverse_monoid(2) from FroidurePin . . . 67μs Sims1 011: symmetric_inverse_monoid(3) . . . 6564μs Sims1 014: temperley_lieb_monoid(3) from presentation . . . 47μs Sims1 015: temperley_lieb_monoid(4) from presentation . . . 644μs Sims1 016: fp semigroup containing given pairs #1 . . . 208μs Sims1 017: fp semigroup containing given pairs #2 . . . 209μs Sims1 018: fp semigroup containing given pairs #3 . . . 364μs Sims1 019: ToddCoxeter failing example . . . 829μs Sims1 020: fp example 2 . . . 1390μs Sims1 021: exceptions . . . 112μs Sims1 027: from https://mathoverflow.net/questions/423541/ . . . 23ms Sims1 028: from https://mathoverflow.net/questions/423541/ . . . 17ms Sims1 030: presentation with one free generator . . . 183μs Sims1 031: presentation with non-zero index generators . . . 40μs Sims1 032: presentation with empty word . . . 7523μs Sims1 033: constructors . . . 999μs Sims1 034: split_at . . . 181μs Sims1 035: stats . . . 57μs Sims1 036: check iterator requirements . . . 90μs Sims1 040: TransitiveGroup(10, 32) - minimal rep . . . 2736μs Sims1 043: rectangular_band(2, 2) - with and without identity . . . 126μs Sims1 044: trivial group - minimal o.r.c. rep . . . 68μs Sims1 045: right zero semigroup - minimal o.r.c. rep . . . 1364μs Sims1 046: semigroup with faithful non-strictly cyclic actio [...] . . . 394μs Sims1 068: RepOrc . . . 25ms Sims1 069: fp example 1 . . . 409μs #0: Sims1: using 0 additional threads #0: Sims1: finding congruences with at most 4 classes #0: Sims1: using 2 generators, and 0 short relations u = v with: #0: Sims1: |u| + |v| ∈ [0, 0] and ∑(|u| + |v|) = 0 #0: Sims1: found 5,477 congruences in 1876μs (342ns per congruence)! #0: Sims1: total number of nodes in search tree was 7,304 #0: Sims1: max. number of pending definitions was 16 Sims1 071: FreeSemigroup(2) up to index 4 . . . 1936μs Sims1 072: symmetric_group(n) for n = 4 . . . 672μs Sims1 073: corner case no generators + no relations . . . 42μs Sims1 076: uninitialized RepOrc . . . 18μs SmallestInteger 001: . . . 6000ns StaticTriVector2 045: all . . . 10μs StaticVector2 043: all . . . 9000ns Stephen 000: basic test 1 . . . 212μs Stephen 001: basic test 2 . . . 90μs Stephen 002: full transf monoid . . . 10ms Stephen 003: from step_hen 002 . . . 48μs Stephen 004: from step_hen 003 . . . 136μs Stephen 005: from step_hen 004 . . . 42μs Stephen 006: from step_hen 005 . . . 99μs Stephen 008: C(4) monoid normal form (test_case_knuth_bendix_055) . . . 117μs Stephen 009: C(4) monoid normal form (test_case_gap_smallove [...] . . . 71μs Stephen 010: code coverage . . . 122μs Stephen 011: C(4) monoid normal form (test_case_gap_smallove [...] . . . 230μs Stephen 012: C(4) monoid normal form (test_case_gap_smallove [...] . . . 183μs Stephen 013: C(4) monoid equal to (test_case_gap_smalloverlap_70) . . . 70μs Stephen 014: C(4) monoid normal form (test_case_ex_3_13_14) . . . 347μs Stephen 015: C(4) monoid normal form (test_case_ex_3_15) . . . 414μs Stephen 016: C(4) monoid normal form (test_case_ex_3_16) . . . 264μs Stephen 017: C(4) monoid normal form (test_case_mt_3) . . . 124μs Stephen 018: C(4) monoid normal form (test_case_mt_5) . . . 82μs Stephen 019: C(4) monoid normal form (test_case_mt_6) . . . 259μs Stephen 020: C(4) monoid normal form (test_case_mt_10) . . . 86μs Stephen 021: C(4) monoid normal form (test_case_mt_13) . . . 75μs Stephen 022: C(4) monoid normal form (test_case_mt_14) . . . 73μs Stephen 023: C(4) monoid normal form (test_case_mt_15) . . . 75μs Stephen 024: C(4) monoid normal form (test_case_mt_16) . . . 84μs Stephen 025: C(4) monoid normal form (test_case_mt_17) . . . 264μs Stephen 026: C(4) monoid normal form (test_case_weak_1) . . . 277μs Stephen 027: C(4) monoid normal form (test_case_weak_2) . . . 148μs Stephen 028: C(4) monoid normal form (test_case_weak_3) . . . 167μs Stephen 029: C(4) monoid normal form (test_case_weak_4) . . . 162μs Stephen 030: C(4) monoid normal form (test_case_weak_5) . . . 85μs Stephen 031: Test behaviour when uninitialised . . . 74μs Suf 005: unite . . . 13μs Suf 007: compress . . . 6000ns Suf 011: big chain . . . 12ms Suf 013: empty table . . . 5000ns Suf 015: join . . . 6000ns Suf 017: contains . . . 18μs Suf 019: swap . . . 20μs Timer 001: string method (1 argument) . . . 35μs Timer 002: string method (0 arguments) . . . 10ms Timer 003: reset/elapsed method . . . 20ms Timer 004: operator<< . . . 5000ns ToddCoxeter 000: small 2-sided congruence . . .  -- with HLT + no standardise + full lookahead + no save 1140μs  -- with HLT + standardise + full lookahead + no save 1195μs  -- with HLT + no standardise + partial lookahead + no save 1130μs  -- with HLT + standardise + partial lookahead + no save 972μs  -- with HLT + no standardise + full lookahead + save 956μs  -- with HLT + standardise + full lookahead + save 948μs  -- with HLT + no standardise + partial lookahead + save 970μs  -- with HLT + standardise + partial lookahead + save 954μs  -- with Felsch + no standardisation 959μs  -- with Felsch + standardisation 952μs  -- with random strategy 982μs  -- with Rc style + full lookahead 990μs  -- with Rc style + partial lookahead 982μs  -- with R/C style 984μs  -- with CR style 984μs  -- with Cr style 989μs ToddCoxeter 001: small 2-sided congruence . . .  -- with HLT + no standardise + full lookahead + no save 4064μs  -- with HLT + standardise + full lookahead + no save 4028μs  -- with HLT + no standardise + partial lookahead + no save 4009μs  -- with HLT + standardise + partial lookahead + no save 4163μs  -- with HLT + no standardise + full lookahead + save 3966μs  -- with HLT + standardise + full lookahead + save 3974μs  -- with HLT + no standardise + partial lookahead + save 3973μs  -- with HLT + standardise + partial lookahead + save 3981μs  -- with Felsch + no standardisation 3959μs  -- with Felsch + standardisation 3972μs  -- with random strategy 3975μs  -- with Rc style + full lookahead 3950μs  -- with Rc style + partial lookahead 3967μs  -- with R/C style 3940μs  -- with CR style 3924μs  -- with Cr style 3950μs ToddCoxeter 003: constructed from FroidurePin . . .  -- with Felsch + no standardisation 4294ms  -- with Felsch + standardisation 4294ms  -- with HLT + no standardise + full lookahead + no save 4294ms  -- with HLT + standardise + full lookahead + no save 4294ms  -- with HLT + no standardise + partial lookahead + no save 4294ms  -- with HLT + standardise + partial lookahead + no save 4294ms  -- with HLT + no standardise + full lookahead + save 4294ms  -- with HLT + standardise + full lookahead + save 4294ms  -- with HLT + no standardise + partial lookahead + save 4294ms  -- with HLT + standardise + partial lookahead + save 4294ms  -- with random strategy 4294ms  -- with Rc style + full lookahead 4294ms  -- with Rc style + partial lookahead 4294ms  -- with R/C style 4294ms  -- with CR style 4294ms  -- with Cr style 4294ms ToddCoxeter 004: 2-sided congruence from FroidurePin . . .  -- with HLT + no standardise + full lookahead + no save 248μs  -- with HLT + standardise + full lookahead + no save 156μs  -- with HLT + no standardise + partial lookahead + no save 148μs  -- with HLT + standardise + partial lookahead + no save 156μs  -- with HLT + save (throws) 163μs  -- with Felsch (throws) 146μs  -- with random strategy 154μs ToddCoxeter 005: non-trivial two-sided from relations . . .  -- with HLT + no standardise + full lookahead + no save 46μs  -- with HLT + standardise + full lookahead + no save 36μs  -- with HLT + no standardise + partial lookahead + no save 31μs  -- with HLT + standardise + partial lookahead + no save 31μs  -- with HLT + no standardise + full lookahead + save 44μs  -- with HLT + standardise + full lookahead + save 39μs  -- with HLT + no standardise + partial lookahead + save 37μs  -- with HLT + standardise + partial lookahead + save 37μs  -- with Felsch + no standardisation 34μs  -- with Felsch + standardisation 32μs  -- with random strategy 42μs  -- with Rc style + full lookahead 34μs  -- with Rc style + partial lookahead 32μs  -- with R/C style 34μs  -- with CR style 34μs  -- with Cr style 34μs ToddCoxeter 006: small right cong. on free semigroup . . .  -- with HLT + no standardise + full lookahead + no save 31μs  -- with HLT + standardise + full lookahead + no save 26μs  -- with HLT + no standardise + partial lookahead + no save 25μs  -- with HLT + standardise + partial lookahead + no save 25μs  -- with HLT + no standardise + full lookahead + save 30μs  -- with HLT + standardise + full lookahead + save 34μs  -- with HLT + no standardise + partial lookahead + save 26μs  -- with HLT + standardise + partial lookahead + save 26μs  -- with Felsch + no standardisation 27μs  -- with Felsch + standardisation 28μs  -- with random strategy 31μs  -- with Rc style + full lookahead 27μs  -- with Rc style + partial lookahead 26μs  -- with R/C style 27μs  -- with CR style 28μs  -- with Cr style 28μs ToddCoxeter 007: left cong. on free semigroup . . .  -- with HLT + no standardise + full lookahead + no save 34μs  -- with HLT + standardise + full lookahead + no save 28μs  -- with HLT + no standardise + partial lookahead + no save 28μs  -- with HLT + standardise + partial lookahead + no save 28μs  -- with HLT + no standardise + full lookahead + save 30μs  -- with HLT + standardise + full lookahead + save 31μs  -- with HLT + no standardise + partial lookahead + save 30μs  -- with HLT + standardise + partial lookahead + save 76μs  -- with Felsch + no standardisation 32μs  -- with Felsch + standardisation 34μs  -- with random strategy 39μs  -- with Rc style + full lookahead 35μs  -- with Rc style + partial lookahead 33μs  -- with R/C style 34μs  -- with CR style 33μs  -- with Cr style 34μs ToddCoxeter 008: for small fp semigroup . . .  -- with HLT + no standardise + full lookahead + no save 30μs  -- with HLT + standardise + full lookahead + no save 25μs  -- with HLT + no standardise + partial lookahead + no save 24μs  -- with HLT + standardise + partial lookahead + no save 24μs  -- with HLT + no standardise + full lookahead + save 27μs  -- with HLT + standardise + full lookahead + save 27μs  -- with HLT + no standardise + partial lookahead + save 26μs  -- with HLT + standardise + partial lookahead + save 26μs  -- with Felsch + no standardisation 26μs  -- with Felsch + standardisation 26μs  -- with random strategy 32μs  -- with Rc style + full lookahead 27μs  -- with Rc style + partial lookahead 27μs  -- with R/C style 28μs  -- with CR style 28μs  -- with Cr style 28μs ToddCoxeter 009: 2-sided cong. trans. semigroup . . .  -- with HLT + no standardise + full lookahead + no save 203μs  -- with HLT + standardise + full lookahead + no save 183μs  -- with HLT + no standardise + partial lookahead + no save 173μs  -- with HLT + standardise + partial lookahead + no save 175μs  -- with HLT + no standardise + full lookahead + save 477μs  -- with HLT + standardise + full lookahead + save 464μs  -- with HLT + no standardise + partial lookahead + save 456μs  -- with HLT + standardise + partial lookahead + save 453μs  -- with Felsch + no standardisation 424μs  -- with Felsch + standardisation 413μs  -- with random strategy 195μs  -- with Rc style + full lookahead 187μs  -- with Rc style + partial lookahead 187μs  -- with R/C style 202μs  -- with CR style 422μs  -- with Cr style 536μs ToddCoxeter 010: left congruence on transformation semigroup . . .  -- with HLT + no standardise + full lookahead + no save 220μs  -- with HLT + standardise + full lookahead + no save 217μs  -- with HLT + no standardise + partial lookahead + no save 207μs  -- with HLT + standardise + partial lookahead + no save 218μs  -- with HLT + no standardise + full lookahead + save 519μs  -- with HLT + standardise + full lookahead + save 512μs  -- with HLT + no standardise + partial lookahead + save 492μs  -- with HLT + standardise + partial lookahead + save 508μs  -- with Felsch + no standardisation 448μs  -- with Felsch + standardisation 425μs  -- with random strategy 573μs  -- with Rc style + full lookahead 245μs  -- with Rc style + partial lookahead 246μs  -- with R/C style 278μs  -- with CR style 478μs  -- with Cr style 480μs ToddCoxeter 011: right cong. trans. semigroup . . .  -- with HLT + no standardise + full lookahead + no save 218μs  -- with HLT + standardise + full lookahead + no save 223μs  -- with HLT + no standardise + partial lookahead + no save 210μs  -- with HLT + standardise + partial lookahead + no save 222μs  -- with HLT + no standardise + full lookahead + save 492μs  -- with HLT + standardise + full lookahead + save 488μs  -- with HLT + no standardise + partial lookahead + save 470μs  -- with HLT + standardise + partial lookahead + save 483μs  -- with Felsch + no standardisation 374μs  -- with Felsch + standardisation 388μs  -- with random strategy 280μs  -- with Rc style + full lookahead 253μs  -- with Rc style + partial lookahead 250μs  -- with R/C style 292μs  -- with CR style 409μs  -- with Cr style 399μs ToddCoxeter 012: trans. semigroup (size 88) . . .  -- with HLT + no standardise + full lookahead + no save 124μs  -- with HLT + standardise + full lookahead + no save 120μs  -- with HLT + no standardise + partial lookahead + no save 113μs  -- with HLT + standardise + partial lookahead + no save 114μs  -- with HLT + save (throws) 128μs  -- with Felsch (throws) 117μs  -- with random strategy 126μs ToddCoxeter 013: left cong. on trans. semigroup (size 88) . . .  -- with HLT + no standardise + full lookahead + no save 182μs  -- with HLT + standardise + full lookahead + no save 191μs  -- with HLT + no standardise + partial lookahead + no save 176μs  -- with HLT + standardise + partial lookahead + no save 184μs  -- with HLT + no standardise + full lookahead + save 510μs  -- with HLT + standardise + full lookahead + save 472μs  -- with HLT + no standardise + partial lookahead + save 459μs  -- with HLT + standardise + partial lookahead + save 467μs  -- with Felsch + no standardisation 417μs  -- with Felsch + standardisation 395μs  -- with random strategy 244μs  -- with Rc style + full lookahead 218μs  -- with Rc style + partial lookahead 218μs  -- with R/C style 254μs  -- with CR style 437μs  -- with Cr style 434μs ToddCoxeter 014: right cong. on trans. semigroup (size 88) . . .  -- with HLT + no standardise + full lookahead + no save 188μs  -- with HLT + standardise + full lookahead + no save 192μs  -- with HLT + no standardise + partial lookahead + no save 182μs  -- with HLT + standardise + partial lookahead + no save 188μs  -- with HLT + no standardise + full lookahead + save 463μs  -- with HLT + standardise + full lookahead + save 452μs  -- with HLT + no standardise + partial lookahead + save 440μs  -- with HLT + standardise + partial lookahead + save 444μs  -- with Felsch + no standardisation 348μs  -- with Felsch + standardisation 358μs  -- with random strategy 248μs  -- with Rc style + full lookahead 221μs  -- with Rc style + partial lookahead 226μs  -- with R/C style 255μs  -- with CR style 372μs  -- with Cr style 366μs ToddCoxeter 015: finite fp-semigroup, dihedral group of order 6 . . .  -- with HLT + no standardise + full lookahead + no save 67μs  -- with HLT + standardise + full lookahead + no save 58μs  -- with HLT + no standardise + partial lookahead + no save 52μs  -- with HLT + standardise + partial lookahead + no save 55μs  -- with HLT + no standardise + full lookahead + save 69μs  -- with HLT + standardise + full lookahead + save 66μs  -- with HLT + no standardise + partial lookahead + save 63μs  -- with HLT + standardise + partial lookahead + save 63μs  -- with Felsch + no standardisation 60μs  -- with Felsch + standardisation 57μs  -- with random strategy 64μs  -- with Rc style + full lookahead 55μs  -- with Rc style + partial lookahead 55μs  -- with R/C style 63μs  -- with CR style 59μs  -- with Cr style 58μs ToddCoxeter 016: finite fp-semigroup, size 16 . . .  -- with HLT + no standardise + full lookahead + no save 61μs  -- with HLT + standardise + full lookahead + no save 57μs  -- with HLT + no standardise + partial lookahead + no save 51μs  -- with HLT + standardise + partial lookahead + no save 54μs  -- with HLT + no standardise + full lookahead + save 117μs  -- with HLT + standardise + full lookahead + save 113μs  -- with HLT + no standardise + partial lookahead + save 107μs  -- with HLT + standardise + partial lookahead + save 110μs  -- with Felsch + no standardisation 105μs  -- with Felsch + standardisation 96μs  -- with random strategy 108μs  -- with Rc style + full lookahead 60μs  -- with Rc style + partial lookahead 60μs  -- with R/C style 64μs  -- with CR style 101μs  -- with Cr style 99μs ToddCoxeter 017: finite fp-semigroup, size 16 . . .  -- with HLT + no standardise + full lookahead + no save 134μs  -- with HLT + standardise + full lookahead + no save 118μs  -- with HLT + no standardise + partial lookahead + no save 115μs  -- with HLT + standardise + partial lookahead + no save 113μs  -- with HLT + no standardise + full lookahead + save 274μs  -- with HLT + standardise + full lookahead + save 279μs  -- with HLT + no standardise + partial lookahead + save 247μs  -- with HLT + standardise + partial lookahead + save 244μs  -- with Felsch + no standardisation 208μs  -- with Felsch + standardisation 201μs  -- with random strategy 229μs  -- with Rc style + full lookahead 121μs  -- with Rc style + partial lookahead 124μs  -- with R/C style 128μs  -- with CR style 211μs  -- with Cr style 208μs ToddCoxeter 018: test lookahead . . .  -- with HLT + no standardise + full lookahead + no save 362μs  -- with HLT + standardise + full lookahead + no save 354μs  -- with HLT + no standardise + partial lookahead + no save 317μs  -- with HLT + standardise + partial lookahead + no save 333μs  -- with HLT + no standardise + full lookahead + save 470μs  -- with HLT + standardise + full lookahead + save 469μs  -- with HLT + no standardise + partial lookahead + save 451μs  -- with HLT + standardise + partial lookahead + save 454μs ToddCoxeter 019: non-trivial left cong. from semigroup . . .  -- with HLT + no standardise + full lookahead + no save 139μs  -- with HLT + standardise + full lookahead + no save 119μs  -- with HLT + no standardise + partial lookahead + no save 111μs  -- with HLT + standardise + partial lookahead + no save 116μs  -- with HLT + save (throws) 128μs  -- with Felsch (throws) 115μs  -- with random strategy 142μs ToddCoxeter 020: 2-sided cong. on free semigroup . . .  -- with HLT + no standardise + full lookahead + no save 17μs  -- with HLT + standardise + full lookahead + no save 14μs  -- with HLT + no standardise + partial lookahead + no save 13μs  -- with HLT + standardise + partial lookahead + no save 13μs  -- with HLT + no standardise + full lookahead + save 13μs  -- with HLT + standardise + full lookahead + save 13μs  -- with HLT + no standardise + partial lookahead + save 13μs  -- with HLT + standardise + partial lookahead + save 13μs  -- with Felsch + no standardisation 13μs  -- with Felsch + standardisation 13μs  -- with random strategy 13μs ToddCoxeter 021: calling run when obviously infinite . . .  -- with HLT + no standardise + full lookahead + no save 23μs  -- with HLT + standardise + full lookahead + no save 19μs  -- with HLT + no standardise + partial lookahead + no save 18μs  -- with HLT + standardise + partial lookahead + no save 18μs  -- with HLT + no standardise + full lookahead + save 18μs  -- with HLT + standardise + full lookahead + save 18μs  -- with HLT + no standardise + partial lookahead + save 18μs  -- with HLT + standardise + partial lookahead + save 17μs  -- with Felsch + no standardisation 18μs  -- with Felsch + standardisation 18μs  -- with random strategy 18μs ToddCoxeter 022: stellar_monoid S3 . . .  -- with HLT + no standardise + full lookahead + no save 105μs  -- with HLT + standardise + full lookahead + no save 90μs  -- with HLT + no standardise + partial lookahead + no save 84μs  -- with HLT + standardise + partial lookahead + no save 87μs  -- with HLT + no standardise + full lookahead + save 177μs  -- with HLT + standardise + full lookahead + save 173μs  -- with HLT + no standardise + partial lookahead + save 159μs  -- with HLT + standardise + partial lookahead + save 162μs  -- with Felsch + no standardisation 148μs  -- with Felsch + standardisation 140μs  -- with random strategy 161μs  -- with Rc style + full lookahead 96μs  -- with Rc style + partial lookahead 99μs  -- with R/C style 105μs  -- with CR style 149μs  -- with Cr style 148μs ToddCoxeter 023: finite semigroup (size 5) . . .  -- with HLT + no standardise + full lookahead + no save 28μs  -- with HLT + standardise + full lookahead + no save 24μs  -- with HLT + no standardise + partial lookahead + no save 23μs  -- with HLT + standardise + partial lookahead + no save 23μs  -- with HLT + no standardise + full lookahead + save 28μs  -- with HLT + standardise + full lookahead + save 26μs  -- with HLT + no standardise + partial lookahead + save 27μs  -- with HLT + standardise + partial lookahead + save 26μs  -- with Felsch + no standardisation 27μs  -- with Felsch + standardisation 26μs  -- with random strategy 28μs  -- with Rc style + full lookahead 25μs  -- with Rc style + partial lookahead 25μs  -- with R/C style 27μs  -- with CR style 27μs  -- with Cr style 27μs ToddCoxeter 024: exceptions . . .  -- with HLT + no standardise + full lookahead + no save 125μs  -- with HLT + standardise + full lookahead + no save 100μs  -- with HLT + no standardise + partial lookahead + no save 97μs  -- with HLT + standardise + partial lookahead + no save 97μs  -- with HLT + no standardise + full lookahead + save 99μs  -- with HLT + standardise + full lookahead + save 99μs  -- with HLT + no standardise + partial lookahead + save 99μs  -- with HLT + standardise + partial lookahead + save 98μs  -- with Felsch + no standardisation 99μs  -- with Felsch + standardisation 109μs  -- with random strategy 102μs  -- with Rc style + full lookahead 100μs  -- with Rc style + partial lookahead 98μs  -- with R/C style 97μs  -- with CR style 101μs  -- with Cr style 100μs ToddCoxeter 025: obviously infinite . . .  -- with HLT + no standardise + full lookahead + no save 37μs  -- with HLT + standardise + full lookahead + no save 33μs  -- with HLT + no standardise + partial lookahead + no save 32μs  -- with HLT + standardise + partial lookahead + no save 33μs  -- with HLT + no standardise + full lookahead + save 33μs  -- with HLT + standardise + full lookahead + save 33μs  -- with HLT + no standardise + partial lookahead + save 33μs  -- with HLT + standardise + partial lookahead + save 33μs  -- with Felsch + no standardisation 34μs  -- with Felsch + standardisation 36μs  -- with random strategy 32μs ToddCoxeter 026: exceptions . . .  -- with HLT + no standardise + full lookahead + no save 72μs  -- with HLT + standardise + full lookahead + no save 59μs  -- with HLT + no standardise + partial lookahead + no save 58μs  -- with HLT + standardise + partial lookahead + no save 56μs  -- with HLT + no standardise + full lookahead + save 60μs  -- with HLT + standardise + full lookahead + save 62μs  -- with HLT + no standardise + partial lookahead + save 61μs  -- with HLT + standardise + partial lookahead + save 61μs  -- with Felsch + no standardisation 60μs  -- with Felsch + standardisation 61μs  -- with random strategy 64μs  -- with Rc style + full lookahead 60μs  -- with Rc style + partial lookahead 58μs  -- with R/C style 59μs  -- with CR style 64μs  -- with Cr style 60μs ToddCoxeter 027: empty . . . 51μs ToddCoxeter 028: congruence of fpsemigroup::ToddCoxeter . . .  -- with HLT + no standardise + full lookahead + no save 102μs  -- with HLT + standardise + full lookahead + no save 74μs  -- with HLT + no standardise + partial lookahead + no save 77μs  -- with HLT + standardise + partial lookahead + no save 72μs  -- with HLT + save (throws) 75μs  -- with Felsch (throws) 74μs  -- with random strategy 77μs  -- with HLT + no standardise + full lookahead + save 73μs  -- with HLT + standardise + full lookahead + save 74μs  -- with HLT + no standardise + partial lookahead + save 82μs  -- with HLT + standardise + partial lookahead + save 73μs  -- with Felsch + no standardisation 72μs  -- with Felsch + standardisation 71μs  -- with Rc style + full lookahead 70μs  -- with Rc style + partial lookahead 70μs  -- with R/C style 70μs  -- with CR style 70μs  -- with Cr style 71μs ToddCoxeter 029: !KnuthBendix.started() . . .  -- with HLT + no standardise + full lookahead + no save and 2-sided 54μs  -- with HLT + standardise + full lookahead + no save and 2-sided 41μs  -- with HLT + no standardise + partial lookahead + no save and 2-sided 40μs  -- with HLT + standardise + partial lookahead + no save and 2-sided 39μs  -- with HLT + no standardise + full lookahead + save and 2-sided 43μs  -- with HLT + standardise + full lookahead + save and 2-sided 41μs  -- with HLT + no standardise + partial lookahead + save and 2-sided 41μs  -- with HLT + standardise + partial lookahead + save and 2-sided 40μs  -- with Felsch + no standardisation and 2-sided 46μs  -- with Felsch + standardisation and 2-sided 40μs  -- with random strategy and 2-sided 43μs  -- with HLT + no standardise + full lookahead + no save and left 42μs  -- with HLT + standardise + full lookahead + no save and left 39μs  -- with HLT + no standardise + partial lookahead + no save and left 40μs  -- with HLT + standardise + partial lookahead + no save and left 43μs  -- with HLT + no standardise + full lookahead + save and left 44μs  -- with HLT + standardise + full lookahead + save and left 44μs  -- with HLT + no standardise + partial lookahead + save and left 44μs  -- with HLT + standardise + partial lookahead + save and left 44μs  -- with Felsch + no standardisation and left 43μs  -- with Felsch + standardisation and left 43μs  -- with random strategy and left 41μs  -- with HLT + no standardise + full lookahead + no save and right 41μs  -- with HLT + standardise + full lookahead + no save and right 39μs  -- with HLT + no standardise + partial lookahead + no save and right 39μs  -- with HLT + standardise + partial lookahead + no save and right 39μs  -- with HLT + no standardise + full lookahead + save and right 44μs  -- with HLT + standardise + full lookahead + save and right 43μs  -- with HLT + no standardise + partial lookahead + save and right 42μs  -- with HLT + standardise + partial lookahead + save and right 53μs  -- with Felsch + no standardisation and right 43μs  -- with Felsch + standardisation and right 42μs  -- with random strategy and right 47μs ToddCoxeter 030: KnuthBendix.finished() . . .  -- with HLT + no standardise + full lookahead + no save and 2-sided 116μs  -- with HLT + standardise + full lookahead + no save and 2-sided 93μs  -- with HLT + no standardise + partial lookahead + no save and 2-sided 91μs  -- with HLT + standardise + partial lookahead + no save and 2-sided 90μs  -- with HLT + no standardise + full lookahead + save and 2-sided 91μs  -- with HLT + standardise + full lookahead + save and 2-sided 90μs  -- with HLT + no standardise + partial lookahead + save and 2-sided 89μs  -- with HLT + standardise + partial lookahead + save and 2-sided 88μs  -- with Felsch + no standardisation and 2-sided 91μs  -- with Felsch + standardisation and 2-sided 85μs  -- with random strategy and 2-sided 103μs  -- with HLT + no standardise + full lookahead + no save and left 98μs  -- with HLT + standardise + full lookahead + no save and left 87μs  -- with HLT + no standardise + partial lookahead + no save and left 86μs  -- with HLT + standardise + partial lookahead + no save and left 87μs  -- with HLT + no standardise + full lookahead + save and left 93μs  -- with HLT + standardise + full lookahead + save and left 91μs  -- with HLT + no standardise + partial lookahead + save and left 98μs  -- with HLT + standardise + partial lookahead + save and left 91μs  -- with Felsch + no standardisation and left 88μs  -- with Felsch + standardisation and left 88μs  -- with random strategy and left 94μs  -- with HLT + no standardise + full lookahead + no save and right 88μs  -- with HLT + standardise + full lookahead + no save and right 85μs  -- with HLT + no standardise + partial lookahead + no save and right 84μs  -- with HLT + standardise + partial lookahead + no save and right 83μs  -- with HLT + no standardise + full lookahead + save and right 91μs  -- with HLT + standardise + full lookahead + save and right 91μs  -- with HLT + no standardise + partial lookahead + save and right 96μs  -- with HLT + standardise + partial lookahead + save and right 91μs  -- with Felsch + no standardisation and right 89μs  -- with Felsch + standardisation and right 87μs  -- with random strategy and right 94μs ToddCoxeter 031: KnuthBendix.finished() . . .  -- with HLT + no standardise + full lookahead + no save and 2-sided 78μs  -- with HLT + standardise + full lookahead + no save and 2-sided 64μs  -- with HLT + no standardise + partial lookahead + no save and 2-sided 63μs  -- with HLT + standardise + partial lookahead + no save and 2-sided 62μs  -- with HLT + no standardise + full lookahead + save and 2-sided 66μs  -- with HLT + standardise + full lookahead + save and 2-sided 64μs  -- with HLT + no standardise + partial lookahead + save and 2-sided 64μs  -- with HLT + standardise + partial lookahead + save and 2-sided 67μs  -- with Felsch + no standardisation and 2-sided 62μs  -- with Felsch + standardisation and 2-sided 60μs  -- with random strategy and 2-sided 66μs  -- with Rc style + full lookahead and 2-sided 64μs  -- with Rc style + partial lookahead and 2-sided 68μs  -- with R/C style and 2-sided 64μs  -- with CR style and 2-sided 63μs  -- with Cr style and 2-sided 68μs  -- with HLT + no standardise + full lookahead + no save and left 67μs  -- with HLT + standardise + full lookahead + no save and left 61μs  -- with HLT + no standardise + partial lookahead + no save and left 60μs  -- with HLT + standardise + partial lookahead + no save and left 66μs  -- with HLT + no standardise + full lookahead + save and left 64μs  -- with HLT + standardise + full lookahead + save and left 66μs  -- with HLT + no standardise + partial lookahead + save and left 70μs  -- with HLT + standardise + partial lookahead + save and left 66μs  -- with Felsch + no standardisation and left 63μs  -- with Felsch + standardisation and left 63μs  -- with random strategy and left 69μs  -- with Rc style + full lookahead and left 66μs  -- with Rc style + partial lookahead and left 64μs  -- with R/C style and left 63μs  -- with CR style and left 67μs  -- with Cr style and left 69μs  -- with HLT + no standardise + full lookahead + no save and right 64μs  -- with HLT + standardise + full lookahead + no save and right 60μs  -- with HLT + no standardise + partial lookahead + no save and right 61μs  -- with HLT + standardise + partial lookahead + no save and right 60μs  -- with HLT + no standardise + full lookahead + save and right 70μs  -- with HLT + standardise + full lookahead + save and right 67μs  -- with HLT + no standardise + partial lookahead + save and right 68μs  -- with HLT + standardise + partial lookahead + save and right 66μs  -- with Felsch + no standardisation and right 64μs  -- with Felsch + standardisation and right 63μs  -- with random strategy and right 71μs  -- with Rc style + full lookahead and right 70μs  -- with Rc style + partial lookahead and right 67μs  -- with R/C style and right 62μs  -- with CR style and right 66μs  -- with Cr style and right 68μs ToddCoxeter 032: prefill . . . 63μs ToddCoxeter 033: congruence of ToddCoxeter . . .  -- with HLT + no standardise + full lookahead + no save 36μs  -- with HLT + standardise + full lookahead + no save 30μs  -- with HLT + no standardise + partial lookahead + no save 29μs  -- with HLT + standardise + partial lookahead + no save 35μs  -- with HLT + no standardise + full lookahead + save 32μs  -- with HLT + standardise + full lookahead + save 30μs  -- with HLT + no standardise + partial lookahead + save 30μs  -- with HLT + standardise + partial lookahead + save 30μs  -- with random strategy 35μs ToddCoxeter 034: congruence of ToddCoxeter . . .  -- with HLT + no standardise + full lookahead + no save 106μs  -- with HLT + standardise + full lookahead + no save 91μs  -- with HLT + no standardise + partial lookahead + no save 89μs  -- with HLT + standardise + partial lookahead + no save 87μs  -- with HLT + save (throws) 92μs  -- with Felsch (throws) 88μs  -- with random strategy 91μs ToddCoxeter 035: congruence on FpSemigroup . . .  -- with HLT + no standardise + full lookahead + no save 247μs  -- with HLT + standardise + full lookahead + no save 191μs  -- with HLT + no standardise + partial lookahead + no save 181μs  -- with HLT + standardise + partial lookahead + no save 181μs  -- with HLT + no standardise + full lookahead + save 206μs  -- with HLT + standardise + full lookahead + save 222μs  -- with HLT + no standardise + partial lookahead + save 201μs  -- with HLT + standardise + partial lookahead + save 197μs  -- with Felsch + no standardisation 200μs  -- with Felsch + standardisation 196μs  -- with random strategy 229μs  -- with Rc style + full lookahead 180μs  -- with Rc style + partial lookahead 180μs  -- with R/C style 179μs  -- with CR style 198μs  -- with Cr style 201μs ToddCoxeter 036: exceptions . . . 78μs ToddCoxeter 037: copy constructor . . . 24μs ToddCoxeter 038: simplify . . . 82μs ToddCoxeter 039: stylic_monoid . . . 990ms ToddCoxeter 041: some finite classes . . . 366μs ToddCoxeter 043: symmetric_group(7, Coxeter + Moser) . . . 139ms ToddCoxeter 044: Option exceptions . . . 53μs ToddCoxeter 045: Options operator<< . . . 445μs ToddCoxeter 046: Easdown-East-FitzGerald DualSymInv(5) . . .  -- with HLT + no standardise + full lookahead + no save 267ms  -- with HLT + standardise + full lookahead + no save 286ms  -- with HLT + no standardise + partial lookahead + no save 246ms  -- with HLT + standardise + partial lookahead + no save 274ms  -- with HLT + no standardise + full lookahead + save 121ms  -- with HLT + standardise + full lookahead + save 121ms  -- with HLT + no standardise + partial lookahead + save 120ms  -- with HLT + standardise + partial lookahead + save 120ms  -- with Felsch + no standardisation 134ms  -- with Felsch + standardisation 134ms  -- with random strategy 218ms  -- with R/C style 191ms  -- with Rc style + full lookahead 138ms  -- with Rc style + partial lookahead 138ms ToddCoxeter 047: uniform_block_bijection_monoid(3) (FitzGerald) . . .  -- with HLT + no standardise + full lookahead + no save 100μs  -- with HLT + standardise + full lookahead + no save 85μs  -- with HLT + no standardise + partial lookahead + no save 80μs  -- with HLT + standardise + partial lookahead + no save 77μs  -- with HLT + no standardise + full lookahead + save 152μs  -- with HLT + standardise + full lookahead + save 143μs  -- with HLT + no standardise + partial lookahead + save 137μs  -- with HLT + standardise + partial lookahead + save 137μs  -- with Felsch + no standardisation 109μs  -- with Felsch + standardisation 102μs  -- with random strategy 147μs  -- with R/C style 87μs  -- with Rc style + full lookahead 79μs  -- with Rc style + partial lookahead 78μs ToddCoxeter 048: stellar_monoid(7) (Gay-Hivert) . . . 141ms ToddCoxeter 049: partition_monoid(4) (East) . . .  -- with HLT + no standardise + full lookahead + no save 28ms  -- with HLT + standardise + full lookahead + no save 29ms  -- with HLT + no standardise + partial lookahead + no save 28ms  -- with HLT + standardise + partial lookahead + no save 29ms  -- with HLT + no standardise + full lookahead + save 47ms  -- with HLT + standardise + full lookahead + save 49ms  -- with HLT + no standardise + partial lookahead + save 47ms  -- with HLT + standardise + partial lookahead + save 48ms  -- with Felsch + no standardisation 57ms  -- with Felsch + standardisation 57ms  -- with random strategy 33ms  -- with R/C style 33ms  -- with Rc style + full lookahead 62ms  -- with Rc style + partial lookahead 62ms ToddCoxeter 050: singular_brauer_monoid(6) (Maltcev + Mazorchuk) . . . 519ms ToddCoxeter 051: orientation_preserving_monoid(6) (Ruskuc + [...] . . .  -- with HLT + no standardise + full lookahead + no save 20ms ToddCoxeter 052: orientation_reversing_monoid(5) (Ruskuc + [...] . . .  -- with HLT + no standardise + full lookahead + no save 5455μs ToddCoxeter 053: temperley_lieb_monoid(10) (East) . . . 39ms ToddCoxeter 063: add_rule . . .  -- with HLT + no standardise + full lookahead + no save 101μs  -- with HLT + standardise + full lookahead + no save 63μs  -- with HLT + no standardise + partial lookahead + no save 60μs  -- with HLT + standardise + partial lookahead + no save 55μs  -- with HLT + no standardise + full lookahead + save 70μs  -- with HLT + standardise + full lookahead + save 58μs  -- with HLT + no standardise + partial lookahead + save 56μs  -- with HLT + standardise + partial lookahead + save 56μs  -- with Felsch + no standardisation 59μs  -- with Felsch + standardisation 56μs  -- with random strategy 63μs  -- with Rc style + full lookahead 56μs  -- with Rc style + partial lookahead 55μs  -- with R/C style 58μs  -- with CR style 57μs  -- with Cr style 57μs  -- with R/C + Felsch lookahead 60μs  -- with HLT + Felsch lookahead + save 54μs  -- with Cr + small number of f_defs 59μs  -- with Rc + small number of deductions 56μs  -- with Felsch + v2 + no preferred defs 66μs  -- with Felsch + v2 + immediate no stack 56μs  -- with Felsch + v1 + immediate no stack 57μs  -- with Felsch + v1 + immediate yes stack 56μs  -- with large collapse 56μs ToddCoxeter 064: (from kbmag/standalone/kb_data/s4) (KnuthB [...] . . .  -- with HLT + no standardise + full lookahead + no save 199μs ToddCoxeter 066: test validate . . . 28μs ToddCoxeter 067: add_rules after construct. from semigroup . . .  -- with HLT + no standardise + full lookahead + no save 308μs  -- with HLT + standardise + full lookahead + no save 273μs  -- with HLT + no standardise + partial lookahead + no save 275μs  -- with HLT + standardise + partial lookahead + no save 267μs  -- with HLT + save (throws) 284μs  -- with Felsch (throws) 276μs  -- with random strategy 276μs ToddCoxeter 068: Sym(5) from Chapter 3, Proposition 1.1 in NR . . .  -- with Deduction policy == purge_from_top 619μs  -- with Deduction policy == purge_all 580μs  -- with Deduction policy == discard_all_if_no_space 613μs  -- with HLT + no standardise + full lookahead + no save 728μs  -- with HLT + standardise + full lookahead + no save 995μs  -- with HLT + no standardise + partial lookahead + no save 721μs  -- with HLT + standardise + partial lookahead + no save 970μs  -- with HLT + no standardise + full lookahead + save 973μs  -- with HLT + standardise + full lookahead + save 972μs  -- with HLT + no standardise + partial lookahead + save 944μs  -- with HLT + standardise + partial lookahead + save 964μs  -- with Felsch + no standardisation 627μs  -- with Felsch + standardisation 609μs  -- with random strategy 1030μs  -- with Rc style + full lookahead 1340μs  -- with Rc style + partial lookahead 1327μs  -- with R/C style 803μs  -- with CR style 673μs  -- with Cr style 660μs ToddCoxeter 069: Chapter 7, Theorem 3.6 in NR (size 243) . . .  -- with HLT + no standardise + full lookahead + no save 490μs  -- with HLT + standardise + full lookahead + no save 532μs  -- with HLT + no standardise + partial lookahead + no save 488μs  -- with HLT + standardise + partial lookahead + no save 523μs  -- with HLT + no standardise + full lookahead + save 495μs  -- with HLT + standardise + full lookahead + save 515μs  -- with HLT + no standardise + partial lookahead + save 492μs  -- with HLT + standardise + partial lookahead + save 515μs  -- with Felsch + no standardisation 2568μs  -- with Felsch + standardisation 2587μs  -- with random strategy 3057μs  -- with Rc style + full lookahead 548μs  -- with Rc style + partial lookahead 533μs  -- with R/C style 581μs  -- with CR style 2565μs  -- with Cr style 2531μs ToddCoxeter 070: finite semigroup (size 99) . . .  -- with HLT + no standardise + full lookahead + no save 215μs  -- with HLT + standardise + full lookahead + no save 220μs  -- with HLT + no standardise + partial lookahead + no save 199μs  -- with HLT + standardise + partial lookahead + no save 213μs  -- with HLT + no standardise + full lookahead + save 205μs  -- with HLT + standardise + full lookahead + save 219μs  -- with HLT + no standardise + partial lookahead + save 197μs  -- with HLT + standardise + partial lookahead + save 208μs  -- with Felsch + no standardisation 459μs  -- with Felsch + standardisation 460μs  -- with random strategy 243μs  -- with Rc style + full lookahead 224μs  -- with Rc style + partial lookahead 224μs  -- with R/C style 240μs  -- with CR style 473μs  -- with Cr style 470μs ToddCoxeter 080: KnuthBendix 098 . . .  -- with HLT + no standardise + full lookahead + no save 776ms  -- with HLT + standardise + full lookahead + no save 803ms  -- with HLT + no standardise + partial lookahead + no save 762ms  -- with HLT + standardise + partial lookahead + no save 780ms  -- with HLT + no standardise + full lookahead + save 385ms  -- with HLT + standardise + full lookahead + save 387ms  -- with HLT + no standardise + partial lookahead + save 386ms  -- with HLT + standardise + partial lookahead + save 387ms  -- with Felsch + no standardisation 364ms  -- with Felsch + standardisation 365ms  -- with random strategy 772ms  -- with Rc style + full lookahead 361ms  -- with Rc style + partial lookahead 358ms  -- with R/C style 756ms  -- with CR style 364ms  -- with Cr style 364ms ToddCoxeter 084: Campbell-Reza 1 . . .  -- with HLT + no standardise + full lookahead + no save 91μs  -- with HLT + standardise + full lookahead + no save 78μs  -- with HLT + no standardise + partial lookahead + no save 59μs  -- with HLT + standardise + partial lookahead + no save 62μs  -- with HLT + no standardise + full lookahead + save 73μs  -- with HLT + standardise + full lookahead + save 69μs  -- with HLT + no standardise + partial lookahead + save 67μs  -- with HLT + standardise + partial lookahead + save 67μs  -- with Felsch + no standardisation 77μs  -- with Felsch + standardisation 70μs  -- with random strategy 64μs  -- with Rc style + full lookahead 59μs  -- with Rc style + partial lookahead 58μs  -- with R/C style 62μs  -- with CR style 73μs  -- with Cr style 78μs ToddCoxeter 085: Renner monoid type D4 (Gay-Hivert), q = 1 . . .  -- with HLT + no standardise + full lookahead + no save 98ms  -- with HLT + standardise + full lookahead + no save 97ms  -- with HLT + no standardise + partial lookahead + no save 101ms  -- with HLT + standardise + partial lookahead + no save 97ms  -- with HLT + no standardise + full lookahead + save 102ms  -- with HLT + standardise + full lookahead + save 101ms  -- with HLT + no standardise + partial lookahead + save 98ms  -- with HLT + standardise + partial lookahead + save 100ms  -- with Felsch + no standardisation 98ms  -- with Felsch + standardisation 97ms  -- with random strategy 98ms  -- with Rc style + full lookahead 101ms  -- with Rc style + partial lookahead 98ms  -- with R/C style 98ms  -- with CR style 98ms  -- with Cr style 97ms ToddCoxeter 086: trivial semigroup . . . 237ms ToddCoxeter 092: ACE --- perf602p5 - HLT . . .  -- with HLT + no standardise + full lookahead + no save 31ms  -- with HLT + standardise + full lookahead + no save 31ms  -- with HLT + no standardise + partial lookahead + no save 30ms  -- with HLT + standardise + partial lookahead + no save 30ms  -- with HLT + no standardise + full lookahead + save 14ms  -- with HLT + standardise + full lookahead + save 14ms  -- with HLT + no standardise + partial lookahead + save 14ms  -- with HLT + standardise + partial lookahead + save 14ms  -- with random strategy 32ms  -- with Felsch + no standardisation 10ms  -- with Felsch + standardisation 10ms ToddCoxeter 094: ACE --- C5 - HLT . . .  -- with HLT + no standardise + full lookahead + no save 66μs  -- with HLT + standardise + full lookahead + no save 56μs  -- with HLT + no standardise + partial lookahead + no save 54μs  -- with HLT + standardise + partial lookahead + no save 55μs  -- with HLT + no standardise + full lookahead + save 70μs  -- with HLT + standardise + full lookahead + save 66μs  -- with HLT + no standardise + partial lookahead + save 64μs  -- with HLT + standardise + partial lookahead + save 64μs  -- with random strategy 72μs  -- with Felsch + no standardisation 66μs  -- with Felsch + standardisation 60μs ToddCoxeter 095: ACE --- A5-C5 . . .  -- with HLT + no standardise + full lookahead + no save 76μs  -- with HLT + standardise + full lookahead + no save 80μs  -- with HLT + no standardise + partial lookahead + no save 72μs  -- with HLT + standardise + partial lookahead + no save 79μs  -- with HLT + no standardise + full lookahead + save 105μs  -- with HLT + standardise + full lookahead + save 102μs  -- with HLT + no standardise + partial lookahead + save 105μs  -- with HLT + standardise + partial lookahead + save 101μs  -- with random strategy 85μs  -- with Felsch + no standardisation 97μs  -- with Felsch + standardisation 86μs ToddCoxeter 096: ACE --- A5 . . .  -- with HLT + no standardise + full lookahead + no save 188μs  -- with HLT + standardise + full lookahead + no save 225μs  -- with HLT + no standardise + partial lookahead + no save 164μs  -- with HLT + standardise + partial lookahead + no save 218μs  -- with HLT + no standardise + full lookahead + save 292μs  -- with HLT + standardise + full lookahead + save 289μs  -- with HLT + no standardise + partial lookahead + save 276μs  -- with HLT + standardise + partial lookahead + save 291μs  -- with random strategy 324μs  -- with Felsch + no standardisation 205μs  -- with Felsch + standardisation 200μs ToddCoxeter 098: relation ordering . . .  -- with Felsch + no standardisation 450μs  -- with Felsch + standardisation 430μs  -- with HLT + no standardise + full lookahead + no save 218μs  -- with HLT + standardise + full lookahead + no save 217μs  -- with HLT + no standardise + partial lookahead + no save 205μs  -- with HLT + standardise + partial lookahead + no save 203μs  -- with HLT + no standardise + full lookahead + save 466μs  -- with HLT + standardise + full lookahead + save 453μs  -- with HLT + no standardise + partial lookahead + save 449μs  -- with HLT + standardise + partial lookahead + save 453μs  -- with random strategy 487μs ToddCoxeter 099: short circuit size in obviously infinite . . . 10μs ToddCoxeter 101: http://brauer.maths.qmul.ac.uk/Atlas/spor/M [...] . . . 561ms ToddCoxeter 108: http://brauer.maths.qmul.ac.uk/Atlas/lin/L3 [...] . . . 498ms ToddCoxeter 110: to_gap_string . . . 49μs ToddCoxeter 111: partition_monoid(2) . . . 44μs ToddCoxeter 112: brauer_monoid(4) (Kudryavtseva + Mazorchuk) . . . 329μs ToddCoxeter 113: symmetric_inverse_monoid . . . 15ms ToddCoxeter 116: symmetric_group(7, Burnside + Miller) . . . 410ms UF 001: constructor by size . . . 7000ns UF 002: copy constructor . . . 11μs UF 003: find . . . 9000ns Ukkonen 000: basic tests . . . 52ms Ukkonen 001: maximal_piece_prefix 1 . . . 19μs Ukkonen 002: maximal_piece_prefix 2 . . . 25μs Ukkonen 003: maximal_piece_prefix 3 . . . 172μs Ukkonen 004: number_of_pieces . . . 47μs Ukkonen 005: traverse . . . 13μs Ukkonen 006: dot . . . 121μs Ukkonen 007: strings . . . 33μs Ukkonen 008: dfs #01 . . . 21μs Ukkonen 009: dfs #02 . . . 20μs Ukkonen 010: dfs #03 . . . 18μs Ukkonen 011: dfs #04 . . . 47μs Ukkonen 012: dfs #05 . . . 34μs Ukkonen 013: dfs #06 . . . 30μs Ukkonen 014: dfs #07 . . . 67μs Ukkonen 015: dfs #08 . . . 44μs Ukkonen 016: dfs #09 . . . 67μs Ukkonen 017: dfs #10 . . . 17μs Ukkonen 018: pieces . . . 22μs Ukkonen 019: code coverage . . . 29μs Ukkonen 020: code coverage . . . 5000ns action_digraph_helper 015: detail::to_string . . . 13μs action_digraph_helper 016: make . . . 19μs action_digraph_helper 017: is_connected . . . 152μs action_digraph_helper 018: is_strictly_cyclic . . . 10ms follow_path 012: 20 node path . . . 13μs fpsemi-examples 002: full_transformation_monoid author except . . . 19μs fpsemi-examples 003: full_transformation_monoid degree except . . . 12μs fpsemi-examples 005: partial_transformation_monoid author except . . . 18μs fpsemi-examples 006: partial_transformation_monoid degree except . . . 15μs fpsemi-examples 007: symmetric_inverse_monoid(5) . . . 15ms fpsemi-examples 008: symmetric_group auth except . . . 23μs fpsemi-examples 009: symmetric_group degree except . . . 14μs fpsemi-examples 010: symmetric_group(6) Burnside + Miller . . . 23ms fpsemi-examples 011: dual_symmetric_inverse_monoid(5) . . . 174ms fpsemi-examples 012: dual_symmetric_inverse_monoid auth except . . . 22μs fpsemi-examples 013: dual_symmetric_inverse_monoid degree except . . . 13μs fpsemi-examples 014: uniform_block_bijection_monoid(5) . . . 12ms fpsemi-examples 015: uniform_block_bijection_monoid auth except . . . 18μs fpsemi-examples 016: uniform_block_bijection_monoid degree except . . . 11μs fpsemi-examples 019: partition_monoid auth except . . . 58μs fpsemi-examples 020: partition_monoid degree except . . . 51μs fpsemi-examples 022: monogenic_semigroup(4, 9) . . . 25μs fpsemi-examples 023: fibonacci_semigroup(2, 5) . . . 55μs fpsemi-examples 024: temperley_lieb_monoid(10) . . . 45ms fpsemi-examples 025: singular_brauer_monoid(6) . . . 395ms fpsemi-examples 026: orientation_preserving_monoid(6) . . . 20ms fpsemi-examples 027: orientation_reversing_monoid(5) . . . 5482μs fpsemi-examples 028: chinese_monoid(3) . . . 109μs fpsemi-examples 029: plactic_monoid(3) . . . 83μs fpsemi-examples 030: stylic_monoid(3) . . . 770μs fpsemi-examples 031: symmetric_group(6) Carmichael . . . 12ms fpsemi-examples 032: symmetric_group(6) Moore index 0 . . . 9063μs fpsemi-examples 033: symmetric_group(6) Coxeter + Moser . . . 6112μs fpsemi-examples 034: test for the rook monoid . . . 261μs fpsemi-examples 035: alternating_group(7) Moore . . . 24ms fpsemi-examples 036: alternating_group auth except . . . 19μs fpsemi-examples 037: alternating_group degree except . . . 10μs fpsemi-examples 038: partial_transformation_monoid(3) Machine . . . 237μs fpsemi-examples 039: chinese_monoid degree except . . . 15μs fpsemi-examples 040: monogenic_semigroup degree except . . . 14μs fpsemi-examples 041: rectangular_band degree except . . . 22μs fpsemi-examples 042: stellar_monoid degree except . . . 13μs fpsemi-examples 043: plactic_monoid degree except . . . 13μs fpsemi-examples 044: stylic_monoid degree except . . . 12μs fpsemi-examples 045: temperley_lieb_monoid degree except . . . 17μs fpsemi-examples 046: singular_brauer_monoid degree except . . . 21μs fpsemi-examples 047: orientation_preserving_monoid degree except . . . 21μs fpsemi-examples 048: orientation_reversing_monoid degree except . . . 24μs fpsemi-examples 049: test default values . . . 2177μs fpsemi-examples 052: not_symmetric_group(5) Guralnick + Kant [...] . . . 2282μs fpsemi-examples 053: order_preserving_monoid(5) . . . 646μs fpsemi-examples 055: order_preserving_monoid degree except . . . 26μs fpsemi-examples 056: cyclic_inverse_monoid(4) Fernandes 1 . . . 199μs fpsemi-examples 057: cyclic_inverse_monoid(8) Fernandes index 1 . . . 12ms fpsemi-examples 058: cyclic_inverse_monoid Fernandes index 0 . . . 25ms fpsemi-examples 059: order_preserving_cyclic_inverse_monoid(4) . . . 122μs fpsemi-examples 060: order_preserving_cyclic_inverse_monoid(10) . . . 29ms fpsemi-examples 061: cyclic_inverse_monoid degree except . . . 48μs fpsemi-examples 062: cyclic_inverse_monoid author except . . . 18μs fpsemi-examples 063: order_preserving_monoid degree except . . . 19μs fpsemi-examples 064: symmetric_group index except . . . 22μs fpsemi-examples 065: symmetric_group(7) Moore index 1 . . . 6878μs fpsemi-examples 066: order_preserving_cyclic_inverse_monoid(10) . . . 29ms fpsemi-examples 067: partial_isometries_cycle_graph_monoid(5) . . . 591μs fpsemi-examples 068: partial_isometries_cycle_graph_monoid(10) . . . 187ms fpsemi-examples 069: partial_isometries_cycle_graph_monoid d [...] . . . 40μs fpsemi-examples 070: partial_isometries_cycle_graph_monoid(4) . . . 267μs freeband_equal_to 001: . . . 457μs is_acyclic 000: 2-cycle . . . 6000ns is_acyclic 001: 1-cycle . . . 5000ns is_acyclic 002: multi-digraph . . . 6000ns is_acyclic 003: complete digraph 100 . . . 85μs is_acyclic 004: acyclic digraph with 20000 nodes . . . 1365μs is_acyclic 006: for a node . . . 838μs is_acyclic 007: for a node . . . 10μs is_reachable 008: acyclic 20 node digraph . . . 24μs is_reachable 009: 100 node path . . . 9315μs is_reachable 010: 100 node cycle . . . 7593μs is_reachable 011: 20 node clique . . . 473μs last_node_on_path_nc 014: 20 node path . . . 9000ns make 000: from FroidurePin . . . 340μs make 001: from FroidurePin and alphabet . . . 404μs make 002: presentation from presentation . . . 114μs make 003: presentation from presentation and alphabet . . . 23μs make 004: argument checks issue . . . 47μs make 005: use human readable alphabet for make . . . 10μs make> 000: from ActionDigraph . . . 1154μs make> 001: from ActionDigraph (exceptions) . . . 24μs number_of_words 001: . . . 7000ns operator"" _w 003: literal . . . 7000ns silo 000: alphabet: a, min: 0, max: 10 . . . 23μs silo 001: corner cases . . . 16μs silo 002: alphabet: ab, min: 1, max: 4 . . . 26μs silo 003: alphabet: abc, min: 0, max: 13 . . . 57ms silo 004: code coverage . . . 15μs sislo 005: alphabet: a, min: 0, max: 10 . . . 20μs sislo 006: corner cases . . . 64μs sislo 007: alphabet: ab, min: 1, max: 4 . . . 46μs sislo 008: alphabet: abc, min: 0, max: 13 . . . 58ms sislo 009: code coverage . . . 13μs string 000: detail::is_suffix . . . 6000ns string 001: detail::is_prefix . . . 7000ns string 002: detail::maximum_common_suffix . . . 6000ns string 003: detail::group_digits . . . 13μs string_to_word 002: . . . 6000ns validate_label 013: 20 node path . . . 23μs wilo 001: corner cases . . . 20μs wilo 002: letters: 2, min: 1, max: 4 . . . 18μs wilo 003: letters: 2, min: 1, max: 4 . . . 32μs wilo 004: letters: 3, min: 0, max: 10 . . . 12ms wilo 005: letters: 3, min: 0, max: 13 . . . 94ms wilo 006: forward iterator requirements . . . 93ms wilo 007: more corner cases . . . 28μs wilo 008: starting at a given word 1 . . . 64μs wilo 009: starting at a given word 2 . . . 10μs wilo 010: code coverage . . . 10μs wislo 000: n: 2, min; 1, max: 4 . . . 13μs wislo 001: corner cases . . . 23μs wislo 002: n: 3, min; 0, max: 10 . . . 3244μs wislo 003: n: 3, min; 0, max: 13 . . . 95ms wislo 004: lex + sort . . . 318ms wislo 005: code coverage . . . 16μs =============================================================================== All tests passed (1226211 assertions in 1190 test cases) >>> libsemigroups: Entering fakeroot... make[1]: Entering directory '/home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3' ./config/install-sh -c -d '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib' ./config/install-sh -c -d '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/include/libsemigroups/backward-cpp' /bin/sh ./libtool --mode=install /usr/bin/install -c libsemigroups.la '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib' /usr/bin/install -c -m 644 extern/backward-cpp/backward.hpp '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/include/libsemigroups/backward-cpp' ./config/install-sh -c -d '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib/pkgconfig' ./config/install-sh -c -d '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/include/libsemigroups' ./config/install-sh -c -d '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/include/libsemigroups/textflowcpp' /usr/bin/install -c -m 644 libsemigroups.pc '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib/pkgconfig' /usr/bin/install -c -m 644 include/libsemigroups/action.hpp include/libsemigroups/adapters.hpp include/libsemigroups/bipart.hpp include/libsemigroups/bitset.hpp include/libsemigroups/bmat8.hpp include/libsemigroups/bmat.hpp include/libsemigroups/bruidhinn-traits.hpp include/libsemigroups/config.hpp include/libsemigroups/cong-intf.hpp include/libsemigroups/cong-pair-impl.hpp include/libsemigroups/cong-pair.hpp include/libsemigroups/cong-wrap.hpp include/libsemigroups/cong.hpp include/libsemigroups/constants.hpp include/libsemigroups/containers.hpp include/libsemigroups/coset.hpp include/libsemigroups/debug.hpp include/libsemigroups/deprecated.hpp include/libsemigroups/digraph-helper.hpp include/libsemigroups/digraph-with-sources.hpp include/libsemigroups/digraph-with-sources.tpp include/libsemigroups/digraph.hpp include/libsemigroups/exception.hpp include/libsemigroups/fastest-bmat.hpp include/libsemigroups/felsch-tree.hpp include/libsemigroups/felsch-digraph.hpp include/libsemigroups/felsch-digraph.tpp include/libsemigroups/forest.hpp include/libsemigroups/fpsemi-examples.hpp include/libsemigroups/fpsemi-intf.hpp include/libsemigroups/fpsemi.hpp include/libsemigroups/freeband.hpp include/libsemigroups/froidure-pin-base.hpp include/libsemigroups/froidure-pin-impl.hpp include/libsemigroups/froidure-pin.hpp include/libsemigroups/function-ref.hpp include/libsemigroups/hpcombi.hpp include/libsemigroups/int-range.hpp include/libsemigroups/iterator.hpp include/libsemigroups/kambites.hpp '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/include/libsemigroups' libtool: install: /usr/bin/install -c .libs/libsemigroups.so.2.0.0 /home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib/libsemigroups.so.2.0.0 /usr/bin/install -c -m 644 extern/textflowcpp/TextFlow.hpp '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/include/libsemigroups/textflowcpp' libtool: install: (cd /home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib && { ln -s -f libsemigroups.so.2.0.0 libsemigroups.so.2 || { rm -f libsemigroups.so.2 && ln -s libsemigroups.so.2.0.0 libsemigroups.so.2; }; }) /usr/bin/install -c -m 644 include/libsemigroups/kbe.hpp include/libsemigroups/knuth-bendix.hpp include/libsemigroups/konieczny.hpp include/libsemigroups/libsemigroups.hpp include/libsemigroups/make-froidure-pin.hpp include/libsemigroups/make-present.hpp include/libsemigroups/matrix.hpp include/libsemigroups/node-manager.hpp include/libsemigroups/obvinf.hpp include/libsemigroups/order.hpp include/libsemigroups/pbr.hpp include/libsemigroups/pool.hpp include/libsemigroups/present.hpp include/libsemigroups/present.tpp include/libsemigroups/race.hpp include/libsemigroups/report.hpp include/libsemigroups/runner.hpp include/libsemigroups/schreier-sims.hpp include/libsemigroups/schreier-sims-helper.hpp include/libsemigroups/sims1.hpp include/libsemigroups/sims1.tpp include/libsemigroups/siso.hpp include/libsemigroups/stl.hpp include/libsemigroups/stephen.hpp include/libsemigroups/string-view.hpp include/libsemigroups/string.hpp include/libsemigroups/tce.hpp include/libsemigroups/timer.hpp include/libsemigroups/todd-coxeter-digraph.hpp include/libsemigroups/todd-coxeter-digraph.tpp include/libsemigroups/todd-coxeter.hpp include/libsemigroups/transf.hpp include/libsemigroups/types.hpp include/libsemigroups/uf.hpp include/libsemigroups/ukkonen.hpp include/libsemigroups/ukkonen.tpp include/libsemigroups/wilo.hpp include/libsemigroups/wislo.hpp include/libsemigroups/word.hpp '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/include/libsemigroups' libtool: install: (cd /home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib && { ln -s -f libsemigroups.so.2.0.0 libsemigroups.so || { rm -f libsemigroups.so && ln -s libsemigroups.so.2.0.0 libsemigroups.so; }; }) libtool: install: /usr/bin/install -c .libs/libsemigroups.lai /home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib/libsemigroups.la libtool: install: /usr/bin/install -c .libs/libsemigroups.a /home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib/libsemigroups.a libtool: install: chmod 644 /home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib/libsemigroups.a libtool: install: ranlib /home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups/usr/lib/libsemigroups.a libtool: warning: remember to run 'libtool --finish /usr/lib' make[1]: Leaving directory '/home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3' >>> libsemigroups-static*: Running split function static... 'usr/lib/libsemigroups.a' -> '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups-static/usr/lib/libsemigroups.a' >>> libsemigroups-static*: Preparing subpackage libsemigroups-static... >>> libsemigroups-static*: Stripping binaries >>> libsemigroups-static*: Running postcheck for libsemigroups-static >>> libsemigroups-dev*: Running split function dev... 'usr/include' -> '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups-dev/usr/include' 'usr/lib/pkgconfig' -> '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups-dev/usr/lib/pkgconfig' 'usr/lib/libsemigroups.so' -> '/home/buildozer/aports/testing/libsemigroups/pkg/libsemigroups-dev/usr/lib/libsemigroups.so' >>> libsemigroups-dev*: Preparing subpackage libsemigroups-dev... >>> libsemigroups-dev*: Stripping binaries >>> libsemigroups-dev*: Running postcheck for libsemigroups-dev >>> libsemigroups*: Running postcheck for libsemigroups >>> libsemigroups*: Preparing package libsemigroups... >>> libsemigroups*: Stripping binaries >>> libsemigroups*: Scanning shared objects >>> libsemigroups-static*: Scanning shared objects >>> libsemigroups-dev*: Scanning shared objects >>> libsemigroups*: Tracing dependencies... so:libc.musl-armv7.so.1 so:libfmt.so.12 so:libgcc_s.so.1 so:libstdc++.so.6 >>> libsemigroups*: Package size: 1.0 MB >>> libsemigroups*: Compressing data... >>> libsemigroups*: Create checksum... >>> libsemigroups*: Create libsemigroups-2.7.3-r2.apk >>> libsemigroups-static*: Tracing dependencies... libsemigroups-dev >>> libsemigroups-static*: Package size: 4.0 MB >>> libsemigroups-static*: Compressing data... >>> libsemigroups-static*: Create checksum... >>> libsemigroups-static*: Create libsemigroups-static-2.7.3-r2.apk >>> libsemigroups-dev*: Tracing dependencies... libsemigroups=2.7.3-r2 pc:eigen3 pc:fmt pkgconfig >>> libsemigroups-dev*: Package size: 1.9 MB >>> libsemigroups-dev*: Compressing data... >>> libsemigroups-dev*: Create checksum... >>> libsemigroups-dev*: Create libsemigroups-dev-2.7.3-r2.apk >>> libsemigroups: Build complete at Tue, 29 Sep 2026 12:01:33 +0000 elapsed time 0h 20m 59s >>> libsemigroups: Cleaning up srcdir >>> libsemigroups: Cleaning up pkgdir >>> libsemigroups: Cleaning up tmpdir >>> libsemigroups: Uninstalling dependencies... (1/4) Purging .makedepends-libsemigroups (20260929.114035) (2/4) Purging eigen-dev (3.4.0-r10) (3/4) Purging fmt-dev (12.2.0-r0) (4/4) Purging fmt (12.2.0-r0) OK: 290.0 MiB in 105 packages >>> libsemigroups: Updating the testing/armv7 repository index... >>> libsemigroups: Signing the index...