>>> libsemigroups: Building testing/libsemigroups 2.7.3-r1 (using abuild 3.14.1-r3) started Sat, 14 Dec 2024 18:55:12 +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 (11.0.2-r0) (3/4) Installing fmt-dev (11.0.2-r0) (4/4) Installing .makedepends-libsemigroups (20241214.185513) OK: 285 MiB in 105 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 >>> libsemigroups: Fetching https://distfiles.alpinelinux.org/distfiles/edge/libsemigroups-2.7.3.tar.gz >>> libsemigroups: Checking sha512sums... libsemigroups-2.7.3.tar.gz: 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' 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... gcc 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 gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking whether gcc understands -c and -o together... yes checking dependency style of gcc... 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 g++ accepts -g... yes checking for g++ option to enable C++11 features... none needed checking dependency style of g++... gcc3 checking whether g++ 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... gcc -E checking for grep that handles long lines and -e... /bin/grep checking for egrep... /bin/grep -E checking whether gcc 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 gcc... /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 gcc 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 gcc supports -fno-rtti -fno-exceptions... no checking for gcc option to produce PIC... -fPIC -DPIC checking if gcc PIC flag -fPIC -DPIC works... yes checking if gcc static flag -static works... yes checking if gcc supports -c -o file.o... yes checking if gcc supports -c -o file.o... (cached) yes checking whether the gcc linker (/usr/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... g++ -E checking for ld used by g++... /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 g++ linker (/usr/armv7-alpine-linux-musleabihf/bin/ld) supports shared libraries... yes checking for g++ option to produce PIC... -fPIC -DPIC checking if g++ PIC flag -fPIC -DPIC works... yes checking if g++ static flag -static works... yes checking if g++ supports -c -o file.o... yes checking if g++ supports -c -o file.o... (cached) yes checking whether the g++ linker (/usr/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-wilo.lo CXX src/libsemigroups_la-ukkonen.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++/14.2.0/bits/stl_algo.h:61, from /usr/include/c++/14.2.0/algorithm:61, from tests/catch.hpp:3598, from tests/test-froidure-pin-maxplustrunc.cpp:24: /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1589:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1589 | __heap_select(_RandomAccessIterator __first, | ^~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1589:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1589:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.2.0/bits/stl_algo.h:1868:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1868 | std::__heap_select(__first, __middle, __last, __comp); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1890 | 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++/14.2.0/bits/stl_algo.h:4771: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4771: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/bits/stl_algo.h:61, from /usr/include/c++/14.2.0/algorithm:61, from tests/test-konieczny-bmat8-2.cpp:18: /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In file included from /usr/include/c++/14.2.0/vector:72, from tests/test-konieczny-bmat8-2.cpp:21: /usr/include/c++/14.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++/14.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++/14.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 In file included from /usr/include/c++/14.2.0/bits/stl_algo.h:61, from /usr/include/c++/14.2.0/algorithm:61, from tests/catch.hpp:3598, from tests/test-konieczny-bmat8-3.cpp:20: /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In file included from /usr/include/c++/14.2.0/vector:72, from tests/catch.hpp:564: /usr/include/c++/14.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++/14.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++/14.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 In file included from /usr/include/c++/14.2.0/bits/stl_algo.h:61, from /usr/include/c++/14.2.0/algorithm:61, from tests/catch.hpp:3598, from tests/test-konieczny-bmat8-1.cpp:20: /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In file included from /usr/include/c++/14.2.0/vector:72, from tests/catch.hpp:564: /usr/include/c++/14.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++/14.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++/14.2.0/bits/vector.tcc:318:7: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 In file included from /usr/include/c++/14.2.0/vector:66: /usr/include/c++/14.2.0/bits/stl_vector.h: In function 'std::vector<_Tp, _Alloc>::vector(std::initializer_list<_Tp>, const allocator_type&) [with _Tp = libsemigroups::BMat8; _Alloc = std::allocator]': /usr/include/c++/14.2.0/bits/stl_vector.h:678:7: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 678 | vector(initializer_list __l, | ^~~~~~ In file included from /usr/include/c++/14.2.0/bits/stl_algo.h:61, from /usr/include/c++/14.2.0/algorithm:61, from tests/test-action.cpp:21: /usr/include/c++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1593: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++/14.2.0/bits/stl_algo.h:1868: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1869: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.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++/14.2.0/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/vector:72, from tests/test-action.cpp:24: /usr/include/c++/14.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++/14.2.0/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ 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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/vector:66: 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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/bits/stl_algo.h:61, from /usr/include/c++/14.2.0/algorithm:61, from tests/test-matrix.cpp:17: /usr/include/c++/14.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++/14.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, | ^~~~~~~~~~~~~ /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_heap.h:224:5: note: parameter passing for argument of type 'libsemigroups::BitSet<2>' changed in GCC 7.1 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++/14.2.0/bits/stl_algo.h:1593: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++/14.2.0/bits/stl_algo.h:1868: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1869: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1593: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++/14.2.0/bits/stl_algo.h:1868: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1869: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1593: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++/14.2.0/bits/stl_algo.h:1868: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1869: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.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++/14.2.0/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h: In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/14.2.0/bits/stl_algo.h:1900:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1900 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1900:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31: /usr/include/c++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector, std::allocator > >::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/vector:66: 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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h: In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/14.2.0/bits/stl_algo.h:1900:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1900 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1900:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31: /usr/include/c++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/vector:66: 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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/algorithm:61, from tests/catch.hpp:3598, from tests/test-bmat8.cpp:24: /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770: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++/14.2.0/bits/stl_algo.h:61, from /usr/include/c++/14.2.0/algorithm:61, from tests/catch.hpp:3598, from tests/test-konieczny-bmat.cpp:20: /usr/include/c++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1593: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++/14.2.0/bits/stl_algo.h:1868: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1869: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++/14.2.0/bits/stl_algo.h:1884:27: /usr/include/c++/14.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 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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:829:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 829 | { _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++/14.2.0/bits/stl_vector.h:829:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 829 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]', 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++/14.2.0/bits/stl_algo.h:4804:18: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 4804 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]', 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++/14.2.0/bits/stl_algo.h:4804:18: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 4804 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.2.0/bits/stl_algo.h:61: /usr/include/c++/14.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++/14.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, | ^~~~~~~~~~~~~ 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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __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++/14.2.0/bits/stl_algo.h:1908: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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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_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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770: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::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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_vector.h:829:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 829 | { _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++/14.2.0/bits/stl_vector.h:829:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 829 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]', 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++/14.2.0/bits/stl_algo.h:4804:18: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 4804 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]', 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++/14.2.0/bits/stl_algo.h:4804:18: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 4804 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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_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++/14.2.0/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1037 | _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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h: In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::InternalLess>]': /usr/include/c++/14.2.0/bits/stl_algo.h:1900:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1900 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1900:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31: /usr/include/c++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/digraph.hpp:46, from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/action.hpp:33, from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/bmat.hpp:24, from tests/test-konieczny-bmat.cpp:24: /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp: In member function 'void libsemigroups::detail::StaticVector1::push_back(T) [with T = libsemigroups::BitSet<32>; unsigned int N = 32]': /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/containers.hpp:799:12: note: parameter passing for argument of type 'libsemigroups::BitSet<32>' changed in GCC 7.1 799 | void push_back(T 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++/14.2.0/bits/stl_vector.h:829:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 829 | { _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++/14.2.0/bits/stl_vector.h:829:24: note: parameter passing for argument of type 'std::__detail::_Node_iterator' changed in GCC 7.1 829 | { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]', 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++/14.2.0/bits/stl_algo.h:4804:18: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 4804 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]', 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++/14.2.0/bits/stl_algo.h:4804:18: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 4804 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/digraph.hpp:53: /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp: In function 'void libsemigroups::matrix_helpers::bitset_row_basis(Container&&, std::decay_t&) [with Mat = libsemigroups::DynamicMatrix; Container = libsemigroups::detail::StaticVector1, 32>&]': /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp:2772:27: note: parameter passing for argument of type 'libsemigroups::BitSet<32>' changed in GCC 7.1 2772 | result.push_back(std::move(rows[i])); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp: In function 'void libsemigroups::matrix_helpers::bitset_row_basis(Container&&, std::decay_t&) [with Mat = libsemigroups::StaticMatrix; Container = libsemigroups::detail::StaticVector1, 32>&]': /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp:2772:27: note: parameter passing for argument of type 'libsemigroups::BitSet<32>' changed in GCC 7.1 2772 | result.push_back(std::move(rows[i])); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp: In function 'void libsemigroups::matrix_helpers::bitset_row_basis(Container&&, std::decay_t&) [with Mat = libsemigroups::StaticMatrix; Container = libsemigroups::detail::StaticVector1, 32>&]': /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp:2772:27: note: parameter passing for argument of type 'libsemigroups::BitSet<32>' changed in GCC 7.1 2772 | result.push_back(std::move(rows[i])); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp: In function 'void libsemigroups::matrix_helpers::bitset_row_basis(Container&&, std::decay_t&) [with Mat = libsemigroups::StaticMatrix; Container = libsemigroups::detail::StaticVector1, 32>&]': /home/buildozer/aports/testing/libsemigroups/src/libsemigroups-2.7.3/include/libsemigroups/matrix.hpp:2772:27: note: parameter passing for argument of type 'libsemigroups::BitSet<32>' changed in GCC 7.1 2772 | result.push_back(std::move(rows[i])); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1890 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908: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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = libsemigroups::Konieczny::InternalLess]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ tests/test-konieczny-bmat8-1.cpp: In function 'void libsemigroups::____C_A_T_C_H____T_E_S_T____8()': tests/test-konieczny-bmat8-1.cpp:156:79: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 156 | BMat8({{1, 1, 0}, {0, 1, 1}, {1, 0, 1}})}; | ^ tests/test-konieczny-bmat8-1.cpp:165:79: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 165 | BMat8({{1, 1, 1}, {1, 1, 1}, {1, 1, 1}})}; | ^ tests/test-konieczny-bmat8-1.cpp:188:52: note: parameter passing for argument of type 'std::initializer_list' changed in GCC 7.1 188 | BMat8({{1, 1, 0}, {1, 1, 1}, {1, 1, 1}})}; | ^ 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) | ^~~~~~~~~~~~ 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++/14.2.0/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = libsemigroups::StaticRowView*; _Compare = libsemigroups::{anonymous}::test_BMat000 >()::]' at /usr/include/c++/14.2.0/bits/stl_algo.h:4804:18, inlined from 'void libsemigroups::{anonymous}::test_BMat000() [with Mat = libsemigroups::StaticMatrix]' at tests/test-matrix.cpp:166:18: /usr/include/c++/14.2.0/bits/stl_algo.h:1817:32: warning: array subscript 16 is outside array bounds of 'libsemigroups::detail::StaticVector1, 2> [1]' [-Warray-bounds=] 1817 | 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++/14.2.0/algorithm:61, from tests/test-todd-coxeter.cpp:20: /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770: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++/14.2.0/bits/stl_algo.h:61: /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1890 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908: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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ 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]}); | ^ 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++/14.2.0/algorithm:61, from tests/catch.hpp:3598, from tests/test-cong.cpp:19: /usr/include/c++/14.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++/14.2.0/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1770: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++/14.2.0/bits/stl_algo.h:61: /usr/include/c++/14.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++/14.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++/14.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++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/14.2.0/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1890 | 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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __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++/14.2.0/bits/stl_algo.h:1908: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++/14.2.0/bits/stl_algo.h:4804: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++/14.2.0/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.2.0/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 1822 | 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 . . . 189μ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 . . . 19ms Action 005: orbits for regular boolean mat monoid 5 . . . 4294ms Action 007: partial perm image orbit . . . 333μs Action 008: partial perm image orbit . . . 90ms Action 009: partial perm image orbit . . . 97ms Action 010: partial perm image orbit . . . 98ms Action 011: permutation on integers . . . 20μs Action 012: permutation on sets, arrays . . . 222μs Action 013: permutation on tuples, arrays . . . 23ms Action 014: permutation on sets, vectors . . . 322μs Action 015: permutation on tuples, vectors . . . 27ms Action 016: misc . . . 314μs Action 017: partial perm image orbit . . . 99μs Action 018: permutation on tuples, arrays (360360) . . . 389ms Action 019: orbits for regular BMat8 monoid 5 with stop/start . . . 4294ms Action 021: orbits for regular boolean mat monoid 5 (BMat<5> [...] . . . 661ms ActionDigraph 000: constructor with 1 default arg . . . 180μs ActionDigraph 001: constructor with 0 default args . . . 30μs ActionDigraph 002: add nodes . . . 20μs ActionDigraph 003: add edges . . . 375μs ActionDigraph 004: strongly connected components - cycles . . . 101μs ActionDigraph 005: strongly connected components - no edges . . . 33ms ActionDigraph 006: strongly connected components - disjoint cycles . . . 1522μs ActionDigraph 007: strongly connected components - complete graphs . . . 741μs ActionDigraph 008: exceptions . . . 124μs ActionDigraph 009: spanning forest - complete graphs . . . 3171μs ActionDigraph 010: spanning forest - disjoint cycles . . . 99μs ActionDigraph 011: restrict . . . 9000ns ActionDigraph 012: remove_edge_nc . . . 8000ns ActionDigraph 013: scc large cycle . . . 17ms ActionDigraph 014: random . . . 97μs ActionDigraph 015: reserve . . . 9000ns ActionDigraph 016: default constructors . . . 13μs ActionDigraph 017: scc iterators . . . 1361μs ActionDigraph 018: iterator to edges . . . 492μs ActionDigraph 019: root of scc . . . 314μs ActionDigraph 020: cbegin/end_panislo - 100 node path . . . 447μs ActionDigraph 021: cbegin/end_pislo . . . 51μs ActionDigraph 022: cbegin/end_pani(s)lo - 100 node cycle . . . 506μs ActionDigraph 023: cbegin/cend_pilo - tree 14 nodes . . . 60μs ActionDigraph 024: cbegin/end_pstilo - Cayley digraph . . . 168ms ActionDigraph 025: cbegin_pstilo - Tsalakou . . . 988μs ActionDigraph 026: cbegin/end_pstislo - Cayley digraph . . . 147ms ActionDigraph 027: cbegin/end_pstislo - Cayley digraph . . . 163μs ActionDigraph 028: path iterators corner cases . . . 110μs ActionDigraph 029: reverse node iterator . . . 9000ns ActionDigraph 030: pstilo corner case . . . 55μs ActionDigraph 031: number_of_paths corner cases . . . 44μs ActionDigraph 032: number_of_paths acyclic digraph . . . 8711μs ActionDigraph 033: number_of_paths binary tree . . . 394ms ActionDigraph 034: number_of_paths large binary tree . . . 111ms ActionDigraph 035: number_of_paths 400 node random digraph . . . 988μs ActionDigraph 036: number_of_paths 10 node acyclic digraph . . . 33μs ActionDigraph 037: number_of_paths node digraph . . . 4318μs ActionDigraph 038: random/random_acyclic exceptions . . . 78μs ActionDigraph 039: unsafe (next) neighbour . . . 62μs ActionDigraph 040: number_of_egdes incident to a node . . . 56μs ActionDigraph 041: number_of_paths (matrix) . . . 29ms ActionDigraph 042: number_of_paths (matrix) . . . 13μs ActionDigraph 043: swap_edge_nc . . . 8000ns ActionDigraph 044: detail::pow for non-square Eigen matrix . . . 15μs ActionDigraph 045: operator<< . . . 11μs Array2 044: all . . . 107μs BMat8 001: transpose . . . 15μs BMat8 002: multiplication . . . 15μs BMat8 003: identity matrix . . . 11μs BMat8 004: random . . . 228μs BMat8 005: call operator . . . 14μs BMat8 006: operator<< . . . 13μs BMat8 007: set . . . 39μs BMat8 008: row space basis . . . 677μs BMat8 009: col space basis . . . 690μs BMat8 010: row space basis . . . 29ms BMat8 011: number_of_rows, number_of_cols . . . 33μs BMat8 012: row_space, col_space . . . 175μs BMat8 013: rows . . . 31μs BMat8 014: one . . . 9000ns BMat8 015: vector constructor . . . 49μs BMat8 016: operator< . . . 11μs BMat8 017: adapters . . . 17μs BMat8 018: one . . . 9000ns Bipartition 009: mem fns 1 . . . 22μs Bipartition 010: hash . . . 7000ns Bipartition 011: mem fns 2 . . . 16μs Bipartition 012: delete/copy . . . 8000ns Bipartition 013: degree 0 . . . 8000ns Bipartition 014: exceptions . . . 100μs Bipartition 015: convenience constructor . . . 236μs Bipartition 016: force copy constructor over move constructor . . . 13μs Bipartition 017: adapters . . . 6000ns BitSet 000: size . . . 8000ns BitSet 001: operator< . . . 8000ns BitSet 002: operator== . . . 84μs BitSet 003: operator!= . . . 9000ns BitSet 004: operator&= . . . 10μs BitSet 005: & . . . 13μs BitSet 006: operator|= . . . 13μs BitSet 007: operator[] . . . 12μs BitSet 008: set(none) . . . 13μs BitSet 009: set(pos, value) . . . 13μs BitSet 010: set(first, last, value) . . . 15μs BitSet 011: reset(first, last) . . . 14μs BitSet 012: reset(pos) . . . 14μs BitSet 013: apply (iterate through set bits) . . . 15μs BitSet 014: std::hash . . . 6000ns BitSet 015: constructors . . . 15μs BitSet 016: max_size . . . 6000ns BitSet 017: insertion operators . . . 11μs Blocks 001: empty blocks . . . 10μs Blocks 002: non-empty blocks . . . 10μs Blocks 003: left blocks of bipartition . . . 10μs Blocks 004: right blocks of bipartition . . . 10μs Blocks 005: copy [empty blocks] . . . 8000ns Blocks 006: copy [non-empty blocks] . . . 10μs Blocks 007: hash value . . . 10μs Blocks 008: operator< . . . 10μs Congruence 000: left congruence on fp semigroup . . . 421μs Congruence 001: 2-sided congruence on fp semigroup . . . 6449μs Congruence 002: left congruence on fp semigroup . . . 6449μs Congruence 003: word_to_class_index for cong. on fp semigroup . . . 6647μs Congruence 004: word_to_class_index for cong. on fp semigroup . . . 10ms Congruence 005: trivial congruence on non-fp semigroup . . . 501μs Congruence 006: 2-sided congruence on non-fp semigroup . . . 285μs Congruence 007: 2-sided congruence on fp semigroup . . . 793μs Congruence 008: 2-sided congruence on infinite fp semigroup . . . 286μs Congruence 009: 2-sided congruence on infinite fp semigroup . . . 340μs Congruence 010: 2-sided congruence on finite semigroup . . . 25ms Congruence 012: 2-sided congruence on finite semigroup . . . 2703μs Congruence 013: trivial 2-sided congruence on bicyclic monoid . . . 22ms Congruence 014: non-trivial 2-sided congruence on bicyclic monoid . . . 7074μs Congruence 015: 2-sided congruence on free abelian monoid . . . 6639μs Congruence 016: example where TC works but KB doesn't . . . 6721μs Congruence 017: 2-sided congruence on finite semigroup . . . 314μs Congruence 018: infinite fp semigroup from GAP library . . . 6325μs Congruence 019: 2-sided cong. on fp semigroup with infinite [...] . . . 10ms Congruence 020: trivial cong. on an fp semigroup . . .  -- with compute size 265μs  -- with don't compute size 201μs Congruence 021: duplicate generators . . . 406μs Congruence 022: non-trivial classes . . . 1206μs Congruence 023: right congruence on finite semigroup . . . 347ms Congruence 024: redundant generating pairs . . . 125μs Congruence 025: 2-sided cong. on free semigroup . . . 257μs Congruence 026: is_quotient_obviously_(in)finite . . . 828μs Congruence 027: less . . . 5879μs Congruence 028: 2-sided congruences of BMat8 semigroup . . . 4294ms Congruence 029: left congruence on finite semigroup . . . 398μs Congruence 030: right congruence on finite semigroup . . . 389μs Congruence 031: right congruence on finite semigroup . . . 328μs Congruence 032: contains . . . 111μs Congruence 033: stellar_monoid S2 . . . 370μs Congruence 034: stellar_monoid S3 . . . 543μs Congruence 035: stellar_monoid S4 . . . 1192μs Congruence 036: stellar_monoid S5 . . . 6310μs Congruence 037: stellar_monoid S6 . . . 56ms Congruence 038: stellar_monoid S7 . . . 695ms Congruence 039: left cong. on an f.p. semigroup . . . 738μs Congruence 040: 2-sided cong. on infinite f.p. semigroup . . . 127μs Congruence 041: 2-sided congruence constructed from type only . . . 233μs Congruence 042: const_contains . . . 481μs Congruence 043: no winner . . . 4837μs Congruence 044: congruence over smalloverlap . . . 6515μs CongruenceByPairs 001: (cong) 2-sided cong. on finite semigroup . . . 515μs CongruenceByPairs 002: (cong) left congruence on finite semigroup . . . 140μs CongruenceByPairs 003: (cong) right congruence on finite semigroup . . . 139μs CongruenceByPairs 004: (cong) trivial congruence on finite s [...] . . . 84μs CongruenceByPairs 005: (cong) trivial left congruence on fin [...] . . . 74μs CongruenceByPairs 006: (cong) trivial right congruence on fi [...] . . . 73μs CongruenceByPairs 007: (cong) universal congruence on finite [...] . . . 461μs CongruenceByPairs 009: (cong) 2-sided congruence on finite s [...] . . . 813ms CongruenceByPairs 010: (cong) left congruence on big finite [...] . . . 36ms CongruenceByPairs 011: (cong) left congruence on TCE . . . 180μs CongruenceByPairs 012: (cong) is_quotient_obviously_finite . . . 100μs CongruenceByPairs 013: (cong) class_index_to_word/quotient . . .  -- with right congruence 9321μs  -- with left congruence 1330μs  -- with 2-sided congruence 8768μs CongruenceByPairs 014: (cong) const_word_to_class_index . . .  -- with right congruence 30μs  -- with left congruence 24μs  -- with 2-sided congruence 23μs CongruenceByPairs 015: (cong) size non-Element* . . . 27ms CongruenceInterface 000: add_pair . . .  -- with ToddCoxeter 110μs  -- with KnuthBendix 161μs  -- with CongruenceByPairs 134μs  -- with Congruence 387μs CongruenceInterface 001: contains/const_contains . . .  -- with ToddCoxeter and no parent 108μs  -- with KnuthBendix and no parent 97μs  -- with Congruence and parent 342μs  -- with CongruenceByPairs and parent 106μs CongruenceInterface 002: less . . .  -- with ToddCoxeter 93μs  -- with KnuthBendix 122μs  -- with CongruenceByPairs 103μs  -- with Congruence 328μs CongruenceInterface 003: is_quotient_obviously_(in)finite . . .  -- with ToddCoxeter 74μs  -- with KnuthBendix 108μs CongruenceInterface 004: is_quotient_obviously_(in)finite . . .  -- with CongruenceByPairs 111μs  -- with Congruence 308μs CongruenceInterface 005: parent_froidure_pin . . .  -- with ToddCoxeter 18μs  -- with KnuthBendix 15μs CongruenceInterface 006: parent_froidure_pin . . .  -- with CongruenceByPairs 108μs  -- with Congruence 290μs CongruenceInterface 007: cbegin/cend_ntc . . .  -- with ToddCoxeter 240μs  -- with KnuthBendix 1088μs CongruenceInterface 008: cbegin/cend_ntc . . .  -- with CongruenceByPairs 186μs  -- with Congruence 387μs CongruenceInterface 009: quotient is immutable . . .  -- with ToddCoxeter 97μs  -- with KnuthBendix 104μs  -- with Congruence 175μs CongruenceInterface 010: no generating pairs added . . .  -- with KnuthBendix and common behaviour 4583μs  -- with Congruence and common behaviour 4638μs  -- with ToddCoxeter 40μs CongruenceInterface 011: nr generators not set . . .  -- with ToddCoxeter 52μs  -- with KnuthBendix 47μs  -- with Congruence 51μs CongruenceInterface 012: no generating pairs . . . 151μs ConstIteratorStateless 001: ? . . . 7000ns ConstIteratorStateless 002: ? . . . 7000ns Constants 001: Undefined . . . 11μs Constants 002: PositiveInfinity . . . 12μs Constants 003: NegativeInfinity . . . 11μs Constants 004: LimitMax . . . 10μs Duf 004: unite . . . 89μs Duf 006: compress . . . 10μs Duf 008: resize . . . 13μs Duf 009: resize . . . 8000ns Duf 010: big chain . . . 13ms Duf 012: empty table . . . 8000ns Duf 014: join . . . 10μs Duf 016: contains . . . 21μs Duf 018: swap . . . 24μs DynamicArray2 001: default constructor with 3 default args . . . 8000ns DynamicArray2 002: default constructor with 2 default args . . . 7000ns DynamicArray2 003: default constructor with 1 default args . . . 78μs DynamicArray2 004: default constructor with 0 default args . . . 7000ns DynamicArray2 005: copy constructor with 1 default args . . . 75μs DynamicArray2 006: copy constructor with 0 default args . . . 10μs DynamicArray2 007: add_rows . . . 10μs DynamicArray2 008: add_rows . . . 9000ns DynamicArray2 009: add_cols . . . 30μs DynamicArray2 010: set/get . . . 31μs DynamicArray2 011: append 1/2 . . . 68μs DynamicArray2 012: append 2/2 . . . 117μs DynamicArray2 013: count . . . 12μs DynamicArray2 014: clear . . . 8000ns DynamicArray2 015: begin_row and end_row . . . 37μs DynamicArray2 016: cbegin_row and cend_row . . . 18μs DynamicArray2 017: iterator operator++ (postfix) . . . 192μs DynamicArray2 018: iterator operator++ (prefix) . . . 1160μs DynamicArray2 019: iterator operator-- (postfix) . . . 250μs DynamicArray2 020: iterator operator-- (prefix) . . . 246μs DynamicArray2 021: operator= . . . 11μs DynamicArray2 022: operator== and operator!= . . . 211μs DynamicArray2 023: empty and clear . . . 10μs DynamicArray2 024: max_size . . . 7000ns DynamicArray2 025: swap . . . 34μs DynamicArray2 026: iterator arithmetic . . . 968μs DynamicArray2 027: iterator comparison . . . 9000ns DynamicArray2 028: iterator operator= . . . 8000ns DynamicArray2 029: iterator operator[] . . . 50μs DynamicArray2 030: iterator operator-> . . . 20μs DynamicArray2 031: const_iterator operator++/-- . . . 165μs DynamicArray2 032: const_iterator operator++/-- . . . 7000ns DynamicArray2 033: column iterators . . . 16μs DynamicArray2 034: column iterator arithmetic . . . 3810μs DynamicArray2 035: iterator assignment constructor . . . 1043μs DynamicArray2 036: reserve method . . . 51μs DynamicArray2 037: erase column . . . 11μs DynamicArray2 038: swap_rows . . . 9000ns DynamicArray2 039: apply_row_permutation . . . 9000ns DynamicArray2 040: swap . . . 7000ns DynamicArray2 041: shrink_rows_to . . . 11μs DynamicArray2 042: shrink_rows_to - for range . . . 11μs FastestBMat 046: check no throw . . . 78μs FelschTree 000: previously failing example . . . 20μs Forest 001: test forest . . . 111μs FpSemigroup 001: Renner monoid type B2 (E. G. presentation), q = 1 . . . 695μs FpSemigroup 002: Renner monoid type B2 (E. G. presentation), q = 0 . . . 629μs FpSemigroup 003: Renner monoid type B3 (E. G. presentation), q = 1 . . . 87ms FpSemigroup 004: Renner monoid type B3 (E. G. presentation), q = 0 . . . 87ms FpSemigroup 005: Renner monoid type B2 (Gay-Hivert presentat [...] . . . 651μs FpSemigroup 006: Renner monoid type B2 (Gay-Hivert presentat [...] . . . 617μs FpSemigroup 007: Renner monoid type B3 (Gay-Hivert presentat [...] . . . 3318μs FpSemigroup 008: Renner monoid type B3 (Gay-Hivert presentat [...] . . . 3360μs FpSemigroup 009: Renner monoid type B4 (Gay-Hivert presentat [...] . . . 169ms FpSemigroup 010: Renner monoid type B4 (Gay-Hivert presentat [...] . . . 240ms FpSemigroup 013: Renner monoid type D2 (E. G. presentation), q = 1 . . . 829μs FpSemigroup 014: Renner monoid type D2 (E. G. presentation), q = 0 . . . 756μs FpSemigroup 015: Renner monoid type D3 (E. G. presentation), q = 1 . . . 4041μs FpSemigroup 016: Renner monoid type D3 (E. G. presentation), q = 0 . . . 3922μs FpSemigroup 017: Renner monoid type D4 (E. G. presentation), q = 1 . . . 1877ms FpSemigroup 018: Renner monoid type D4 (E. G. presentation), q = 0 . . . 1877ms FpSemigroup 019: Renner monoid type D2 (Gay-Hivert presentat [...] . . . 804μs FpSemigroup 020: Renner monoid type D2 (Gay-Hivert presentat [...] . . . 713μs FpSemigroup 021: Renner monoid type D3 (Gay-Hivert presentat [...] . . . 3950μs FpSemigroup 022: Renner monoid type D3 (Gay-Hivert presentat [...] . . . 3944μs FpSemigroup 023: Renner monoid type D4 (Gay-Hivert presentat [...] . . . 72ms FpSemigroup 024: Renner monoid type D4 (Gay-Hivert presentat [...] . . . 79ms FpSemigroup 029: Rook monoid R5, q = 0 . . . 4640μs FpSemigroup 030: Rook monoid R5, q = 1 . . . 4556μs FpSemigroup 031: Rook monoid R6, q = 0 . . . 39ms FpSemigroup 032: Rook monoid R6, q = 1 . . . 39ms FpSemigroup 033: normal_form . . . 163μs FpSemigroup 034: for a finite semigroup . . . 379μs FpSemigroup 035: finite fp semigroup, dihedral group of order 6 . . . 250μs FpSemigroup 036: finite fp semigroup, size 16 . . . 368μs FpSemigroup 037: finite fp semigroup, size 16 . . . 664μs FpSemigroup 038: fp semigroup, size 240 . . . 666μs FpSemigroup 039: add_rule . . . 179μs FpSemigroup 040: add_rule . . . 79μs FpSemigroup 041: equal_to . . . 134μs FpSemigroup 042: cbegin/cend_rules . . . 34μs FpSemigroup 043: semigroup of size 3 . . . 228μs FpSemigroup 044: run_for/until . . . 2452μs FpSemigroup 045: constructors . . . 179μs FpSemigroup 046: set_inverses . . . 88μs FpSemigroup 047: smalloverlap . . . 6249μs FpSemigroup 048: quaternion group Q8 . . . 290μs FpSemigroup 049: symmetric group Coxeter presentation . . . 59ms FpSemigroupByPairs 029: (fpsemi) 2-sided congruence on finit [...] . . . 467μs FpSemigroupByPairs 030: (fpsemi) 2-sided congruence on finit [...] . . . 431μs FpSemigroupInterface 000: run with no alphabet . . .  -- with ToddCoxeter 99μs  -- with KnuthBendix 15μs  -- with FpSemigroup 22μs FpSemigroupInterface 001: equal_to . . .  -- with ToddCoxeter and human readable alphabet 1117μs  -- with KnuthBendix and human readable alphabet 3868μs  -- with FpSemigroup and human readable alphabet 3080μs  -- with FpSemigroupByPairs 2570μs FpSemigroupInterface 002: normal_form . . .  -- with ToddCoxeter 128μs  -- with KnuthBendix 149μs  -- with FpSemigroup 289μs FpSemigroupInterface 003: set_alphabet (1/2) . . .  -- with ToddCoxeter 46μs  -- with KnuthBendix 35μs  -- with FpSemigroup 41μs FpSemigroupInterface 004: set_alphabet (2/2) . . . 1231μs FpSemigroupInterface 005: add_rule after finished . . .  -- with ToddCoxeter and human readable alphabet 98μs  -- with KnuthBendix and human readable alphabet 107μs  -- with FpSemigroup and human readable alphabet 269μs  -- with FpSemigroupByPairs 1223μs FpSemigroupInterface 006: add_rule with equal words (1/2) . . .  -- with ToddCoxeter and human readable alphabet 124μs  -- with KnuthBendix and human readable alphabet 172μs  -- with FpSemigroup and human readable alphabet 213μs  -- with FpSemigroupByPairs 119μs FpSemigroupInterface 007: add_rule with equal words (2/2) . . .  -- with ToddCoxeter 17μs  -- with KnuthBendix 14μs  -- with FpSemigroup 20μs FpSemigroupInterface 008: add_rule with word_type . . .  -- with ToddCoxeter 25μs  -- with KnuthBendix 21μs  -- with FpSemigroup 48μs FpSemigroupInterface 009: add_rule with empty word (1/2) . . .  -- with ToddCoxeter 19μs  -- with FpSemigroup 22μs FpSemigroupInterface 010: add_rule with empty word (1/2) . . . 10μs FpSemigroupInterface 011: add_rules (1/3) . . .  -- with ToddCoxeter 93μs  -- with KnuthBendix 22μs  -- with FpSemigroup 25μs FpSemigroupInterface 012: add_rules (2/3) . . . 279μs FpSemigroupInterface 013: add_rules (3/3) . . .  -- with ToddCoxeter 18μs  -- with KnuthBendix 17μs  -- with FpSemigroup 47μs FpSemigroupInterface 014: set_identity (1/3) . . .  -- with ToddCoxeter 54μs  -- with KnuthBendix 46μs  -- with FpSemigroup 77μs FpSemigroupInterface 015: set_identity (2/3) . . . 139μs FpSemigroupInterface 016: set_identity (3/3) . . .  -- with ToddCoxeter 34μs  -- with KnuthBendix 33μs  -- with FpSemigroup 66μs FpSemigroupInterface 017: identity . . .  -- with ToddCoxeter 17μs  -- with KnuthBendix 14μs  -- with FpSemigroup 20μs FpSemigroupInterface 018: set_inverses + inverses (1/2) . . .  -- with ToddCoxeter 64μs  -- with KnuthBendix 64μs  -- with FpSemigroup 104μs FpSemigroupInterface 019: set_inverses + inverses (2/2) . . . 164μs FpSemigroupInterface 020: is_obviously_infinite (1/2) . . .  -- with ToddCoxeter 115μs  -- with KnuthBendix 134μs  -- with FpSemigroup 255μs FpSemigroupInterface 021: is_obviously_infinite (2/2) . . . 23μs FpSemigroupInterface 022: is_obviously_finite (1/2) . . .  -- with ToddCoxeter 106μs  -- with KnuthBendix 124μs  -- with FpSemigroup 236μs FpSemigroupInterface 023: is_obviously_finite (2/2) . . . 20μs FpSemigroupInterface 024: to_gap_string (1/3) . . .  -- with ToddCoxeter 20μs  -- with KnuthBendix 18μs  -- with FpSemigroup 50μs FpSemigroupInterface 025: to_gap_string (2/3) . . . 11μs FpSemigroupInterface 026: to_gap_string (3/3) . . . 18μs FroidurePin 016: (BMat8) exception zero generators given . . . 77μs FroidurePin 017: (BMat8) exception word_to_element . . . 36μs FroidurePin 018: (BMat8) exception prefix . . . 1313μs FroidurePin 019: (BMat8) exception suffix . . . 15μs FroidurePin 020: (BMat8) exception first_letter . . . 1237μs FroidurePin 021: (BMat8) exception final_letter . . . 14μs FroidurePin 022: (BMat8) exception current_length . . . 1119μs FroidurePin 023: (BMat8) exception product_by_reduction . . . 835μs FroidurePin 024: (BMat8) exception fast_product . . . 819μ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 . . . 42μs FroidurePin 031: (integers) . . . 280μs FroidurePin 039: (pairs of integers) non-trivial user type . . . 155μs FroidurePin 055: (tropical max-plus semiring matrices) . . . 392μs FroidurePin 061: projective max plus matrix . . . 1005μs FroidurePin 062: projective max plus matrix . . . 24μs FroidurePin> 009: small example 2 . . . 96μs FroidurePin> 005: small example 1 . . . 84μs FroidurePin> 007: regular bmat monoid 4 . . . 72ms FroidurePin> 011: small example 3 . . . 546μs FroidurePin> 006: small example 1 . . . 107μs FroidurePin> 008: regular bmat monoid 4 . . . 84ms FroidurePin> 010: small example 2 . . . 40μs FroidurePin> 012: small example 3 . . . 608μs FroidurePin 000: small example 1 . . . 111μs FroidurePin 001: default constructed . . . 97μs FroidurePin 002: small example 2 . . . 38μs FroidurePin 004: exception: is_idempotent . . . 101μs FroidurePin> 033: Example 000 . . . 6075μs FroidurePin> 035: Example 001 . . . 32μs FroidurePin> 032: Example 000 . . . 5921μs FroidurePin> 034: Example 001 . . . 27μs FroidurePin 036: exception: current_position . . . 72μs FroidurePin 037: exception: word_to_element . . . 38μs FroidurePin 038: exception: prefix, suffix, first_letter . . . 11ms FroidurePin> 040: Example 000 . . . 187μs FroidurePin> 041: Example 000 . . . 113μs FroidurePin> 046: Example 005 . . . 218μs FroidurePin> 047: Example 005 . . . 209μs FroidurePin> 048: Example 005 . . . 145μs FroidurePin> 044: Example 004 . . . 20μs FroidurePin> 045: Example 004 . . . 21μs FroidurePin> 049: Example 006 . . . 825μs FroidurePin> 050: Example 006 . . . 963μs FroidurePin> 051: Example 006 . . . 965μs FroidurePin> 052: Example 007 . . . 116μs FroidurePin> 053: Example 007 . . . 125μs FroidurePin> 054: Example 007 . . . 146μs FroidurePin 056: example 1 . . . 141μs FroidurePin 057: example 2 . . . 135μs FroidurePin> 058: . . . 504μs FroidurePin> 059: . . . 38μs FroidurePin> 060: exceptions: add_generator(s) . . . 79μs FroidurePin> 065: no exception zero generators given . . . 85μs FroidurePin> 066: exception generators of different [...] . . . 168μs FroidurePin> 067: exception current_position . . . 28μs FroidurePin> 068: exception word_to_element . . . 25μs FroidurePin> 069: exception gens . . . 521μs FroidurePin> 070: exception prefix . . . 11ms FroidurePin> 071: exception suffix . . . 31ms FroidurePin> 072: exception first_letter . . . 33μs FroidurePin> 073: exception final_letter . . . 25μs FroidurePin> 074: exception current_length . . . 25μs FroidurePin> 075: exception product_by_reduction . . . 213μs FroidurePin> 076: exception fast_product . . . 210μs FroidurePin> 077: exception current_position . . . 524μs FroidurePin> 078: exception is_idempotent . . . 494μs FroidurePin> 079: exception add_generators . . . 22μs FroidurePin> 080: multithread number_of_idempotents . . . 435μs FroidurePin> 081: small semigroup . . . 21μs FroidurePin> 082: large semigroup . . . 6093μs FroidurePin> 083: at, position, current_* . . . 6111μs FroidurePin> 084: run . . . 5929μs FroidurePin> 085: run [many stops and starts] . . . 5851μs FroidurePin> 086: factorisation, length [1 element] . . . 5903μs FroidurePin> 087: factorisation, products [all elements] . . . 7406μs FroidurePin> 088: first/final letter, prefix, suffi [...] . . . 5843μs FroidurePin> 089: current_position [standard] . . . 20μs FroidurePin> 090: current_position [duplicate gens] . . . 10ms FroidurePin> 091: current_position [after add_generators] . . . 6414μs FroidurePin> 092: cbegin_idempotents/cend [1 thread] . . . 6535μs FroidurePin> 093: idempotent_cend/cbegin [1 thread] . . . 6508μs FroidurePin> 094: is_idempotent [1 thread] . . . 6266μs FroidurePin> 096: finished, started . . . 5861μs FroidurePin> 097: current_position . . . 1315μs FroidurePin> 098: sorted_position, sorted_at . . . 7242μs FroidurePin> 099: right/left Cayley graph . . . 33ms FroidurePin> 100: iterator . . . 9309μs FroidurePin> 101: reverse iterator . . . 9406μs FroidurePin> 102: iterator arithmetic . . . 25ms FroidurePin> 103: iterator sorted . . . 25ms FroidurePin> 104: iterator sorted arithmetic . . . 27ms FroidurePin> 105: copy [not enumerated] . . . 6055μs FroidurePin> 106: copy_closure [not enumerated] . . . 39ms FroidurePin> 107: copy_add_generators [not enumerated] . . . 37ms FroidurePin> 108: copy [partly enumerated] . . . 6531μs FroidurePin> 109: copy_closure [partly enumerated] . . . 10ms FroidurePin> 110: copy_add_generators [partly enumerated] . . . 6587μs FroidurePin> 111: copy [fully enumerated] . . . 8924μs FroidurePin> 112: copy_closure [fully enumerated] . . . 10ms FroidurePin> 113: copy_add_generators [fully enumerated] . . . 9165μs FroidurePin> 114: relations [duplicate gens] . . . 154μs FroidurePin> 115: relations . . . 8047μs FroidurePin> 116: relations [copy_closure, duplicat [...] . . . 10ms FroidurePin> 117: relations [copy_add_generators, d [...] . . . 10ms FroidurePin> 118: relations [from copy, not enumerated] . . . 6987μs FroidurePin> 119: relations [from copy, partly enum [...] . . . 12ms FroidurePin> 120: relations [from copy, fully enumerated] . . . 12ms FroidurePin> 121: relations [from copy_closure, not [...] . . . 11ms FroidurePin> 122: relations [from copy_add_generato [...] . . . 6924μs FroidurePin> 123: relations [from copy_closure, par [...] . . . 10ms FroidurePin> 124: relations [from copy_add_generato [...] . . . 8527μs FroidurePin> 125: relations [from copy_closure, ful [...] . . . 12ms FroidurePin> 126: relations [from copy_add_generato [...] . . . 11ms FroidurePin> 127: add_generators [duplicate generators] . . . 301μs FroidurePin> 128: add_generators [incremental 1] . . . 352μs FroidurePin> 129: add_generators [incremental 2] . . . 432μs FroidurePin> 130: closure [duplicate generators] . . . 176μs FroidurePin> 131: closure . . . 83μs FroidurePin> 132: factorisation . . . 17μs FroidurePin> 134: minimal_factorisation . . . 35μs FroidurePin> 135: batch_size (for an extremely larg [...] . . . 16μs FroidurePin> 137: exception: generators of differen [...] . . . 16μs FroidurePin> 138: exception: current_position . . . 29μs FroidurePin> 139: exception: word_to_element . . . 27μs FroidurePin> 140: exception: gens, current_position . . . 478μs FroidurePin> 141: exception: add_generators . . . 19μs KBE 000: constructors . . . 30μs KBE 001: test . . . 51μs KBE 002: factorisation . . . 38μs KBE 003: swap . . . 25μs KBE 004: adapters . . . 25μs KBE 005: conversions . . . 25μs Kambites 000: (fpsemi) MT test 4 (std::string) . . . 5978μs Kambites 001: (fpsemi) MT test 4 (MultiStringView) . . . 6995μs Kambites 002: (fpsemi) number_of_pieces (std::string) . . . 95μs Kambites 003: (fpsemi) number_of_pieces (MultiStringView) . . . 73μs Kambites 004: (fpsemi) small_overlap_class (std::string) . . . 2524μs Kambites 005: (fpsemi) small_overlap_class (MultiStringView) . . . 2527μs Kambites 006: (fpsemi) random (std::string) . . . 10ms Kambites 007: (fpsemi) random (MultiStringView) . . . 10ms Kambites 008: (fpsemi) KnuthBendix 055 (std::string) . . . 14ms Kambites 009: (fpsemi) KnuthBendix 055 (MultiStringView) . . . 17ms Kambites 010: (fpsemi) smalloverlap/gap/test.gi:85 (std::string) . . . 63μs Kambites 011: (fpsemi) smalloverlap/gap/test.gi:85 (MultiStr [...] . . . 56μs Kambites 012: (fpsemi) free semigroup . . . 10μs Kambites 013: (fpsemi) smalloverlap/gap/test.gi:49 (std::string) . . . 33ms Kambites 014: (fpsemi) smalloverlap/gap/test.gi:49 (MultiStr [...] . . . 44ms Kambites 015: (fpsemi) smalloverlap/gap/test.gi:63 (std::string) . . . 34ms Kambites 016: (fpsemi) smalloverlap/gap/test.gi:63 (MultiStr [...] . . . 50ms Kambites 017: (fpsemi) smalloverlap/gap/test.gi:70 (std::string) . . . 125ms Kambites 018: (fpsemi) smalloverlap/gap/test.gi:70 (MultiStr [...] . . . 184ms Kambites 021: (fpsemi) code coverage (std::string) . . . 37μs Kambites 022: (fpsemi) code coverage (MultiStringView) . . . 24μs Kambites 023: (fpsemi) prefix (std::string) . . . 53μs Kambites 024: (fpsemi) prefix (MultiStringView) . . . 80μs Kambites 025: (fpsemi) normal_form (Example 3.15) (std::string) . . . 64μs Kambites 026: (fpsemi) normal_form (Example 3.15) (MultiStri [...] . . . 84μs Kambites 027: (fpsemi) normal_form (Example 3.16) (std::string) . . . 39μs Kambites 028: (fpsemi) normal_form (Example 3.16) (MultiStri [...] . . . 59μs Kambites 029: (fpsemi) normal_form (Example 3.16) more exhau [...] . . . 75ms Kambites 030: (fpsemi) normal_form (Example 3.16) more exhau [...] . . . 77ms Kambites 031: (fpsemi) small presentation (std::string) . . . 44μs Kambites 032: (fpsemi) small presentation (MultiStringView) . . . 28μs Kambites 033: (fpsemi) non-smalloverlap (std::string) . . . 34μs Kambites 034: (fpsemi) non-smalloverlap (MultiStringView) . . . 33μs Kambites 035: (fpsemi) MT test 3 (std::string) . . . 36μs Kambites 036: (fpsemi) MT test 3 (MultiStringView) . . . 38μs Kambites 037: (fpsemi) MT test 5 (std::string) . . . 21μs Kambites 038: (fpsemi) MT test 5 (MultiStringView) . . . 20μs Kambites 039: (fpsemi) MT test 6 (std::string) . . . 30μs Kambites 040: (fpsemi) MT test 6 (MultiStringView) . . . 38μs Kambites 041: (fpsemi) MT test 10 (std::string) . . . 28μs Kambites 042: (fpsemi) MT test 10 (MultiStringView) . . . 36μs Kambites 043: (fpsemi) MT test 13 (std::string) . . . 20μs Kambites 044: (fpsemi) MT test 13 (MultiStringView) . . . 22μs Kambites 045: (fpsemi) MT test 14 (std::string) . . . 19μs Kambites 046: (fpsemi) MT test 14 (MultiStringView) . . . 21μs Kambites 047: (fpsemi) MT test 15 (std::string) . . . 29μs Kambites 048: (fpsemi) MT test 15 (MultiStringView) . . . 30μs Kambites 049: (fpsemi) MT test 16 (std::string) . . . 29μs Kambites 050: (fpsemi) MT test 16 (MultiStringView) . . . 31μs Kambites 051: (fpsemi) MT test 17 (std::string) . . . 91μs Kambites 052: (fpsemi) MT test 17 (MultiStringView) . . . 77μs Kambites 053: (fpsemi) weak C(4) not strong x 1 (std::string) . . . 458μs Kambites 054: (fpsemi) weak C(4) not strong x 1 (MultiStringView) . . . 613μs Kambites 055: (fpsemi) weak C(4) not strong x 2 (std::string) . . . 463μs Kambites 056: (fpsemi) weak C(4) not strong x 2 (MultiStringView) . . . 631μs Kambites 057: (fpsemi) weak C(4) not strong x 3 (std::string) . . . 447μs Kambites 058: (fpsemi) weak C(4) not strong x 3 (MultiStringView) . . . 403μs Kambites 059: (fpsemi) weak C(4) not strong x 4 (std::string) . . . 45μs Kambites 060: (fpsemi) weak C(4) not strong x 4 (MultiStringView) . . . 64μs Kambites 061: (fpsemi) weak C(4) not strong x 5 (std::string) . . . 21μs Kambites 062: (fpsemi) weak C(4) not strong x 5 (MultiStringView) . . . 18μs Kambites 063: (fpsemi) weak C(4) not strong x 6 (std::string) . . . 28μs Kambites 064: (fpsemi) weak C(4) not strong x 6 (MultiStringView) . . . 31μs Kambites 065: (fpsemi) Konovalov example (std::string) . . . 17μs Kambites 066: (fpsemi) Konovalov example (MultiStringView) . . . 16μs Kambites 067: (fpsemi) long words (std::string) . . . 1851ms Kambites 068: (fpsemi) long words (MultiStringView) . . . 49ms Kambites 075: (cong) example 1 . . . 38μs Kambites 076: (cong) example 2 . . . 84μs Kambites 077: (cong) code coverage . . . 6458μs Kambites 078: (cong) large number of rules . . . 223ms KnuthBendix 000: (fpsemi) confluent fp semigroup 1 (infinite) . . . 91μs KnuthBendix 001: (fpsemi) confluent fp semigroup 2 (infinite) . . . 145μs KnuthBendix 002: (fpsemi) confluent fp semigroup 3 (infinite) . . . 70μs KnuthBendix 003: (fpsemi) non-confluent fp semigroup from wi [...] . . . 128μs KnuthBendix 004: (fpsemi) Example 5.1 in Sims (infinite) . . . 108μs KnuthBendix 005: (fpsemi) Example 5.1 in Sims (infinite) . . . 103μs KnuthBendix 006: (fpsemi) Example 5.3 in Sims . . . 87μs KnuthBendix 007: (fpsemi) Example 5.4 in Sims . . . 104μs KnuthBendix 008: (fpsemi) Example 6.4 in Sims (size 168) . . . 6535μs KnuthBendix 009: (fpsemi) . . . 38ms KnuthBendix 010: (fpsemi) SL(2, 7) from Chapter 3, Propositi [...] . . . 64ms KnuthBendix 011: (fpsemi) F(2, 5) - Chapter 9, Section 1 in [...] . . . 401μs KnuthBendix 012: (fpsemi) Reinis example 1 . . . 150μs KnuthBendix 013: redundant_rule (std::string) . . . 100ms KnuthBendix 014: redundant_rule (word_type) . . . 10ms KnuthBendix 019: (fpsemi) C(4) monoid . . . 92μs KnuthBendix 020: (cong) Chinese monoid . . . 179μs KnuthBendix 021: (from kbmag/standalone/kb_data/f25monoid) . . . 438μs KnuthBendix 022: (from kbmag/standalone/kb_data/degen4a) . . . 40ms KnuthBendix 023: (from kbmag/standalone/kb_data/torus) . . . 2695μs KnuthBendix 024: (from kbmag/standalone/kb_data/3a6) . . . 191ms KnuthBendix 025: (from kbmag/standalone/kb_data/f2) . . . 38μs KnuthBendix 026: (from kbmag/standalone/kb_data/s16) . . . 83ms KnuthBendix 027: (from kbmag/standalone/kb_data/a4monoid) . . . 48μs KnuthBendix 028: (from kbmag/standalone/kb_data/degen3) . . . 18μs KnuthBendix 029: (from kbmag/standalone/kb_data/ab1) . . . 17μs KnuthBendix 030: (from kbmag/standalone/kb_data/degen2) . . . 12μs KnuthBendix 031: (from kbmag/standalone/kb_data/f25) . . . 395μs KnuthBendix 032: (from kbmag/standalone/kb_data/237) . . . 512μs KnuthBendix 033: (from kbmag/standalone/kb_data/c2) . . . 12μs KnuthBendix 034: (from kbmag/standalone/kb_data/cosets) . . . 194μs KnuthBendix 035: Example 5.1 in Sims (KnuthBendix 09 again) . . . 45μs KnuthBendix 036: (from kbmag/standalone/kb_data/nilp2) . . . 34μs KnuthBendix 037: Example 6.4 in Sims . . . 10ms KnuthBendix 038: KnuthBendix 071 again . . . 598μs KnuthBendix 039: Example 5.4 in Sims (KnuthBendix 11 again) [...] . . . 176μs KnuthBendix 040: Example 5.4 in Sims (KnuthBendix 11 again) [...] . . . 134μs KnuthBendix 041: operator<< . . . 103μs KnuthBendix 042: confluence_interval . . . 14μs KnuthBendix 043: max_overlap . . . 13μs KnuthBendix 044: (fpsemi) (from kbmag/standalone/kb_data/d22 [...] . . . 1149μs KnuthBendix 045: (fpsemi) (from kbmag/standalone/kb_data/d22 [...] . . . 2089μs KnuthBendix 046: (fpsemi) small example . . . 627μs KnuthBendix 047: code coverage . . . 41μs KnuthBendix 048: small overlap 1 . . . 45μs KnuthBendix 049: (from kbmag/standalone/kb_data/s9) . . . 1401μs KnuthBendix 050: (fpsemi) Chapter 11, Lemma 1.8 (q = 6, r = [...] . . . 619μs KnuthBendix 051: (fpsemi) Chapter 11, Section 2 (q = 6, r = [...] . . . 100μs KnuthBendix 052: (fpsemi) Chapter 8, Theorem 4.2 in NR (infinite) . . . 203μs KnuthBendix 053: (fpsemi) equal_to fp semigroup . . . 56μs KnuthBendix 054: (fpsemi) equal_to free semigroup . . . 31μs KnuthBendix 055: (fpsemi) from GAP smalloverlap gap/test.gi [...] . . . 275μs KnuthBendix 056: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 465μs KnuthBendix 057: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 479μs KnuthBendix 058: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 1280μs KnuthBendix 059: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 3051μs KnuthBendix 060: (fpsemi) from GAP smalloverlap gap/test.gi: [...] . . . 31μs KnuthBendix 061: (fpsemi) Von Dyck (2,3,7) group (infinite) . . . 478μs KnuthBendix 062: (fpsemi) Von Dyck (2,3,7) group - different [...] . . . 3889μs KnuthBendix 063: (fpsemi) rewriting system from KnuthBendixC [...] . . . 347μs KnuthBendix 064: (fpsemi) rewriting system from Congruence 20 . . . 31μs KnuthBendix 065: (fpsemi) (from kbmag/standalone/kb_data/ab2) . . . 84μs KnuthBendix 066: (fpsemi) (from kbmag/standalone/kb_data/d22 [...] . . . 1195μs KnuthBendix 067: (fpsemi) (from kbmag/standalone/kb_data/degen1) . . . 24μs KnuthBendix 068: (fpsemi) (from kbmag/standalone/kb_data/s4) . . . 289μs KnuthBendix 069: (fpsemi) fp semigroup (infinite) . . . 47μs KnuthBendix 070: (fpsemi) Chapter 11, Section 1 (q = 4, r = [...] . . . 1503μs KnuthBendix 071: (fpsemi) Chapter 11, Section 1 (q = 8, r = [...] . . . 79ms KnuthBendix 072: (fpsemi) Chapter 7, Theorem 3.9 in NR (size 240) . . . 2669μs KnuthBendix 073: (fpsemi) F(2, 5) - Chapter 9, Section 1 in [...] . . . 405μs KnuthBendix 074: (fpsemi) F(2, 6) - Chapter 9, Section 1 in NR . . . 422μs KnuthBendix 075: (fpsemi) Chapter 10, Section 4 in NR (infinite) . . . 786μs KnuthBendix 076: (fpsemi) Sym(5) from Chapter 3, Proposition [...] . . . 2436μs KnuthBendix 077: (fpsemi) SL(2, 7) from Chapter 3, Propositi [...] . . . 62ms KnuthBendix 078: (fpsemi) bicyclic monoid (infinite) . . . 33μs KnuthBendix 079: (fpsemi) plactic monoid of degree 2 (infinite) . . . 52μs KnuthBendix 080: (fpsemi) example before Chapter 7, Proposit [...] . . . 30μs KnuthBendix 081: (fpsemi) Chapter 7, Theorem 3.6 in NR (size 243) . . . 679μs KnuthBendix 082: (fpsemi) finite semigroup (size 99) . . . 210μs KnuthBendix 096: Sorouhesh . . . 308μs KnuthBendix 097: (fpsemi) transformation semigroup (size 4) . . . 45μs KnuthBendix 098: (fpsemi) transformation semigroup (size 9) . . . 39μs KnuthBendix 099: (fpsemi) transformation semigroup (size 88) . . . 591μs KnuthBendix 100: internal_string_to_word . . . 29μs KnuthBendix 101: (fpsemi) construct from shared_ptr . . . 596μs KnuthBendix 102: internal_string_to_word . . . 699μs KnuthBendix 103: (cong) free semigroup congruence (5 classes) . . . 127μs KnuthBendix 104: free semigroup congruence (6 classes) . . . 243μs KnuthBendix 105: (cong) free semigroup congruence (16 classes) . . . 291μs KnuthBendix 106: (cong) free semigroup congruence (6 classes) . . . 455μs KnuthBendix 107: (cong) free semigroup congruence (240 classes) . . . 2750μs KnuthBendix 108: (cong) free semigroup congruence (240 classes) . . . 2493μs KnuthBendix 109: (cong) less . . . 3550μs KnuthBendix 110: (cong) less . . . 141ms KnuthBendix 111: (cong) constructors . . . 215ms KnuthBendix 112: (cong) const_contains/contains . . . 152μs KnuthBendix 113: (cong) is_quotient_obviously_finite . . . 16μs KnuthBendix 114: (cong) class_index_to_word . . . 167μs KnuthBendix 115: (cong) quotient_froidure_pin . . . 125μs KnuthBendix 116: (cong) set_number_of_generators . . . 16μs KnuthBendix 117: (cong) number of classes when obv-inf . . . 50μs KnuthBendixCongruenceByPairs 016: non-trivial congruence on [...] . . . 155μs KnuthBendixCongruenceByPairs 017: non-trivial congruence on [...] . . . 180μs KnuthBendixCongruenceByPairs 018: non-trivial congruence on [...] . . . 314μs KnuthBendixCongruenceByPairs 019: non-trivial congruence on [...] . . . 314μs KnuthBendixCongruenceByPairs 020: trivial congruence on a fi [...] . . . 165μs KnuthBendixCongruenceByPairs 021: universal congruence on a [...] . . . 505μs KnuthBendixCongruenceByPairs 022: left congruence on a finit [...] . . . 234μs KnuthBendixCongruenceByPairs 023: finite group, Chapter 11, [...] . . . 3928μs KnuthBendixCongruenceByPairs 024: right congruence on infini [...] . . . 286μs KnuthBendixCongruenceByPairs 025: finite fp semigroup, dihed [...] . . . 315μs KnuthBendixCongruenceByPairs 026: finite fp semigroup, size 16 . . . 321μs KnuthBendixCongruenceByPairs 027: finite fp semigroup, size 16 . . . 933μs KnuthBendixCongruenceByPairs 028: infinite fp semigroup with [...] . . . 49μs Konieczny 000: test000> . . . 1457μs Konieczny 001: test000> . . . 744μs Konieczny 002: test001> . . . 10ms Konieczny 003: test001> . . . 8871μs Konieczny 006: exceptions . . . 100μs Konieczny 007: code coverage . . . 13ms Konieczny 008: code coverage . . . 11ms Konieczny 009: regular elements and idempotents . . . 4294ms Konieczny 010: regular D-class 01 . . . 1379μs Konieczny 011: regular D-class 02 . . . 32ms Konieczny 012: regular D-class 04: contains . . . 3923ms Konieczny 013: non-regular D-classes 01 . . . 1411μs Konieczny 014: RegularDClass . . . 708μs Konieczny 015: full bmat monoid 4 . . . 427ms Konieczny 017: regular generated bmat monoid 4 idempotents . . . 271ms Konieczny 019: my favourite example . . . 148ms Konieczny 020: another large example . . . 24ms Konieczny 021: my favourite example transposed . . . 295ms Konieczny 024: exceptions . . . 1413μs Konieczny 025: 0-parameter constructor . . . 29ms Konieczny 026: non-regular D-classes 02 . . . 33ms Konieczny 028: partial perm . . . 197ms Konieczny 029: symmetric inverse monoid n = 8 . . . 39ms Konieczny 030: exceptions . . . 251ms Konieczny 031: transformations . . . 1153μs Konieczny 032: transformations - JDM favourite example . . . 144ms Konieczny 033: transformations - large example . . . 370ms Konieczny 034: transformations - large example with stop . . . 368ms Konieczny 035: transformations - large example with run_until . . . 368ms Konieczny 036: transformations - large example with stop in Action . . . 369ms Konieczny 037: exceptions . . . 40μs Konieczny 038: transformations: contains . . . 581μs Konieczny 040: transformations - destructor coverage . . . 299ms Konieczny 041: current_number_D_classes . . . 298ms Konieczny 042: add_generator . . . 39μs Konieczny 043: add_generator . . . 22μs Matrix 000: BMat<2> . . . 367μs Matrix 001: BMat<> . . . 123μs Matrix 002: BMat<3> + BMat<> . . . 10μs Matrix 003: BMat<2> + BMat<> . . . 9000ns Matrix 004: BMat<3> . . . 9000ns Matrix 005: BMat<> . . . 11μs Matrix 006: BMat<3> row_basis . . . 97μs Matrix 007: BMat<> row_basis . . . 26μs Matrix 008: IntMat<3> . . . 13μs Matrix 009: IntMat<> . . . 14μs Matrix 010: IntMat code cov . . . 7000ns Matrix 011: MaxPlusMat<3> . . . 10μs Matrix 012: MaxPlusMat<> . . . 11μs Matrix 013: MaxPlusMat code cov . . . 6000ns Matrix 014: MinPlusMat<3> . . . 12μs Matrix 015: MinPlusMat<> . . . 14μs Matrix 016: MinPlusMat code cov . . . 6000ns Matrix 017: MaxPlusTruncMat<5, 2> . . . 12μs Matrix 018: MaxPlusTruncMat<5> . . . 14μs Matrix 019: MaxPlusTruncMat<> . . . 19μs Matrix 020: MaxPlusTruncMat<5, 4> . . . 14μs Matrix 021: MaxPlusTruncMat<5> . . . 14μs Matrix 022: MaxPlusTruncMat<> . . . 14μs Matrix 023: MaxPlusTruncMat<33, 3> . . . 20μs Matrix 024: MaxPlusTruncMat<33> . . . 18μs Matrix 025: MaxPlusTruncMat<> . . . 18μs Matrix 026: MaxPlusMat code cov . . . 6000ns Matrix 027: MinPlusTruncMat<33, 3> . . . 19μs Matrix 028: MinPlusTruncMat<33> . . . 19μs Matrix 029: MinPlusTruncMat<> . . . 23μs Matrix 030: NTPMat<0, 3, 3, 3> . . . 11μs Matrix 031: NTPMat<0, 3> . . . 12μs Matrix 032: NTPMat<> . . . 22μs Matrix 033: NTPMat<0, 10, 4, 4> . . . 20μs Matrix 034: NTPMat<0, 10> . . . 15μs Matrix 035: NTPMat<> . . . 15μs Matrix 036: NTPMat<0, 10, 4, 4> . . . 14μs Matrix 037: NTPMat<0, 10> . . . 13μs Matrix 038: NTPMat<> . . . 14μs Matrix 039: NTPMat<33, 2, 3, 3> . . . 11μs Matrix 040: NTPMat<33, 2> . . . 11μs Matrix 041: NTPMat<> . . . 11μs Matrix 042: ProjMaxPlusMat<3> . . . 59μs Matrix 043: ProjMaxPlusMat<> . . . 39μs Matrix 044: exceptions . . . 19μs Matrix 045: code coverage . . . 24μs MultiStringView 000: catch all . . . 26μs MultiStringView 001: is_prefix . . . 10μs MultiStringView 002: erase . . . 12μs MultiStringView 003: iterators . . . 8000ns MultiStringView 004: constructors (long) . . . 16μs MultiStringView 005: constructors (short) . . . 12μs MultiStringView 006: copy assignment (short assigned to long) . . . 9000ns MultiStringView 007: copy assignment (short assigned to short) . . . 9000ns MultiStringView 008: move assignment (short assigned to long) . . . 9000ns MultiStringView 009: move assignment (short assigned to short) . . . 9000ns MultiStringView 010: code coverage . . . 14μs MultiStringView 011: pop_front . . . 100μs MultiStringView 012: append . . . 10μs MultiStringView 013: operators . . . 10μs MultiStringView 014: maximum_common_suffix . . . 9000ns MultiStringView 015: deep tests . . . 7000ns ObviouslyInfinite 011: Multiple rule additions . . . 100μs ObviouslyInfinite 012: A power of the generator 'b' does not [...] . . . 8000ns ObviouslyInfinite 013: Preserves the number of occurrences o [...] . . . 8000ns ObviouslyInfinite 014: Less relations than generators . . . 8000ns ObviouslyInfinite 015: Relations preserve length . . . 9000ns ObviouslyInfinite 016: Matrix has non empty kernel . . . 8000ns ObviouslyInfinite 017: Free product of trivial semigroups . . . 8000ns ObviouslyInfinite 018: Another free product . . . 9000ns ObviouslyInfinite 019: Infinite but not obviously so . . . 9000ns ObviouslyInfinite 020: Finite semigroup . . . 10μs PBR 001: universal product with convenience constructor . . . 32μs PBR 002: universal product . . . 13μs PBR 003: product [bigger than previous] . . . 19μs PBR 004: hash . . . 7000ns PBR 005: delete/copy . . . 12μs PBR 006: exceptions . . . 75μs PBR 007: operators . . . 53μs PBR 008: to_string . . . 13μs PBR 009: identity . . . 33μs PBR 010: adapters . . . 6000ns Pool 000: initial . . . 18μs Pool 001: bmat . . . 15μs Pool 002: PoolGuard . . . 13μs Pool 003: transformation products . . . 11μs Presentation 000: vectors of ints . . . 202μs Presentation 001: strings . . . 107μs Presentation 002: constructors (word_type) . . . 16μs Presentation 003: constructors (StaticVector1) . . . 184μs Presentation 004: constructors (std::string) . . . 15μs Presentation 005: alphabet + letters (word_type) . . . 143μs Presentation 006: alphabet + letters (std::string) . . . 22μs Presentation 007: contains_empty_word . . . 8000ns Presentation 008: validate_rules throws . . . 22μs Presentation 009: helpers add_rule(s) . . . 41μs Presentation 010: helpers add_rule(s) (std::string) . . . 16μs Presentation 011: helpers add_identity_rules (std::vector/St [...] . . . 23μs Presentation 012: helpers add_identity_rules (std::string) . . . 16μs Presentation 013: helpers add_inverse_rules (all) . . . 91μs Presentation 014: helpers add_inverse_rules (std::string) . . . 55μs Presentation 015: helpers remove_duplicate_rules . . . 33μs Presentation 016: helpers reduce_complements . . . 75μs Presentation 017: helpers sort_each_rule . . . 34μs Presentation 018: helpers sort_rules . . . 36μs Presentation 019: helpers longest_common_subword/replace_subword . . . 186μs Presentation 020: helpers redundant_rule . . . 11ms Presentation 021: helpers shortlex_compare_concat . . . 8000ns Presentation 022: helpers remove_trivial_rules . . . 43μs Presentation 023: helpers replace_subword (existing, replacement) . . . 75μs Presentation 024: helpers longest_rule . . . 55μs Presentation 025: helpers longest_rule_length . . . 47μs Presentation 026: helpers remove_redundant_generators . . . 109μs Presentation 027: helpers reverse . . . 15μs Presentation 028: in_alphabet . . . 18μs Presentation 029: replace_subword with empty word . . . 12μs Presentation 030: helpers replace_word . . . 26μs Presentation 031: clear . . . 8000ns Presentation 032: letter . . . 23μs Presentation 033: normalize_alphabet . . . 11μs Presentation 034: longest_common_subword issue . . . 204μs Presentation 035: helpers add_zero_rules (std::vector/Static [...] . . . 27μs Presentation 036: helpers add_zero_rules (std::string) . . . 15μs Presentation 037: make_semigroup . . . 49μs Presentation 038: greedy_reduce_length . . . 124μs Presentation 039: aaaaaaaab = aaaaaaaaab strong compression . . . 39μs Presentation 040: change_alphabet . . . 37μs Presentation 041: sort_rules bug . . . 199μs Presentation 042: first_unused_letter/letter . . . 128μs Presentation 043: case where strong compression doesn't work . . . 23μs Presentation 044: proof that . . . 27μs Presentation 045: decompression . . . 13μs Race 001: run_for . . . 10ms Race 002: run_until . . . 10ms Race 003: exceptions . . . 10ms Race 004: iterators . . . 10μs Race 005: find_runner . . . 10μs Race 006: run_func . . . 27ms Race 007: run_func . . . 10ms Race 008: run_func . . . 21ms Runner 000: run_for . . . 10ms Runner 001: run_for . . . 1008μs Runner 002: run_for . . . 232ms Runner 003: run_for . . . 26ms Runner 004: started . . . 1011μs Runner 005: run_until . . . 33ms Runner 006: kill . . . 10μs Runner 007: copy constructor . . . 10ms Runner 008: report . . . 20ms Runner 009: run_until with function pointer . . . 8000ns SchreierSims 001: trivial perm. group (degree 1) . . . 89μs SchreierSims 002: trivial perm. group (degree 2) . . . 156μs SchreierSims 003: trivial perm. group (degree 500) . . . 115μs SchreierSims 004: symmetric perm. group (degree 5) . . . 18μs SchreierSims 005: symmetric perm. group (degree 8) . . . 29μs SchreierSims 006: symmetric perm. group (degree 9) . . . 40μs SchreierSims 007: alternating perm. group (degree 12) . . . 70μs SchreierSims 008: symmetric perm. group (degree 16) . . . 582μs SchreierSims 009: alternating perm. group (degree 15) . . . 373μs SchreierSims 010: alternating perm. group (degree 16) . . . 656μs SchreierSims 011: dihedral perm. group (order 10) . . . 12μs SchreierSims 012: dihedral perm. group (order 200) . . . 846μs SchreierSims 013: perm. group T (order 12) . . . 13μs SchreierSims 014: quaternion perm. group (order 8) . . . 15μs SchreierSims 015: perm. group (order 84129611558952960) . . . 252ms SchreierSims 016: perm. group SL(3, 5) (order 372000) . . . 1158μs SchreierSims 017: perm. group PSL(4, 8) (order 34558531338240) . . . 110ms SchreierSims 018: perm. Mathieu group M11 (order 7920) . . . 58μs SchreierSims 019: perm. Mathieu group M24 (order 244823040) . . . 188μs SchreierSims 020: perm. Janko Group J1 (order 175560) . . . 2654μs SchreierSims 021: perm. Hall-Janko group (order 604800) . . . 350μs SchreierSims 022: perm. Hall-Janko group (alt.) (order 604800) . . . 23ms SchreierSims 023: perm. Conway group Co3 (order 495766656000) . . . 7297μs SchreierSims 024: perm. Conway group Co3 (alt.) (order 49576 [...] . . . 16ms SchreierSims 025: perm. Suzuki group (order 448345497600) . . . 81ms SchreierSims 027: perm. Held group (order 4030387200) . . . 137ms SchreierSims 028: perm. group C2 x C2 x C2 (order 8) . . . 23μs SchreierSims 029: perm. group C2 x C2 x C2 x C2 (order 16) . . . 25μs SchreierSims 030: perm. group (S5 x S5) : C2 (order 28800) . . . 54μs SchreierSims 031: perm. group C3 x D8 x A5 (order 1440) . . . 61μs SchreierSims 032: perm. group GL(4, 3) (order 24261120) . . . 727μs SchreierSims 033: perm. group PSL(3, 7) (order 1876896) . . . 714μs SchreierSims 037: symmetric perm. group (degree 5) . . . 22μs SchreierSims 038: alternating perm. group (degree 17) . . . 3290μs SchreierSims 039: exceptions . . . 54μs SchreierSims 040: exceptions . . . 26μs SchreierSims 041: trivial group . . . 21μs SchreierSims 042: A17 bug . . . 2937μs SchreierSims 043: orbits_lookup test . . . 462μs SchreierSims 044: transversal_element and inversal_element test . . . 795μs SchreierSimsHelper 001: trivial perm. group intersection (de [...] . . . 87μs SchreierSimsHelper 002: trivial perm. group intersection (de [...] . . . 84μs SchreierSimsHelper 003: cyclic group intersection (degree 13) . . . 22μs SchreierSimsHelper 004: D10 and Z5 intersection . . . 22μs SchreierSimsHelper 005: D8 and Q8 intersection . . . 20μs SchreierSimsHelper 006: primitive on 8 points intersection . . . 62μs SchreierSimsHelper 007: primitive on 8 points intersection ( [...] . . . 59μs SchreierSimsHelper 008: A13 and PGL(2, 11) intersection . . . 538μs SchreierSimsHelper 009: A13 and PGL(2, 11) intersection (swa [...] . . . 542μs SchreierSimsHelper 012: 3^3:13 and 3^3.2.A(4) intersection . . . 240μs SchreierSimsHelper 015: 3^3(S(4) x 2) and ASL(3, 3) intersection . . . 313μs SchreierSimsHelper 016: 7^2:3 x Q(8) and 7^2:D(2*6) intersection . . . 357μs SchreierSimsHelper 018: D(2*53) and 53:13 intersection . . . 198μs SchreierSimsHelper 019: 2^6:(7 x D_14) and PSL(2, 6)^2.4 int [...] . . . 2001μs SchreierSimsHelper 020: 2^6:(S_3 x GL(3, 2)) and 2.6:Alt(7) [...] . . . 6387μs SchreierSimsHelper 022: PSL(2, 127) and AGL(1, 2^7) intersection . . . 11ms SchreierSimsHelper 023: PSL(3, 4).2 and PSL(3, 4).2 (nontriv [...] . . . 2165μs SchreierSimsHelper 024: PSL(3, 4).Sym(3) and PSL(3, 4).2 int [...] . . . 2190μs SchreierSimsHelper 025: 3^4:5:4 and D_16:4 intersection . . . 1206μs Sims1 000: fp example 1 . . . 888μs Sims1 001: fp example 2 . . . 1543μs Sims1 002: ToddCoxeter failing example . . . 13ms Sims1 003: ToddCoxeter failing example . . . 618μs Sims1 004: partition_monoid(2) right . . . 4900μs Sims1 006: full_transformation_monoid(3) right . . . 5757μs Sims1 007: full_transformation_monoid(3) left . . . 3237μs Sims1 009: rook_monoid(2, 1) . . . 73μs Sims1 010: symmetric_inverse_monoid(2) from FroidurePin . . . 71μs Sims1 011: symmetric_inverse_monoid(3) . . . 6250μs Sims1 014: temperley_lieb_monoid(3) from presentation . . . 51μs Sims1 015: temperley_lieb_monoid(4) from presentation . . . 658μs Sims1 016: fp semigroup containing given pairs #1 . . . 208μs Sims1 017: fp semigroup containing given pairs #2 . . . 208μs Sims1 018: fp semigroup containing given pairs #3 . . . 366μs Sims1 019: ToddCoxeter failing example . . . 862μs Sims1 020: fp example 2 . . . 1416μs Sims1 021: exceptions . . . 120μ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 . . . 180μs Sims1 031: presentation with non-zero index generators . . . 43μs Sims1 032: presentation with empty word . . . 7153μs Sims1 033: constructors . . . 989μs Sims1 034: split_at . . . 180μs Sims1 035: stats . . . 61μs Sims1 036: check iterator requirements . . . 94μs Sims1 040: TransitiveGroup(10, 32) - minimal rep . . . 2770μs Sims1 043: rectangular_band(2, 2) - with and without identity . . . 129μs Sims1 044: trivial group - minimal o.r.c. rep . . . 86μs Sims1 045: right zero semigroup - minimal o.r.c. rep . . . 1416μs Sims1 046: semigroup with faithful non-strictly cyclic actio [...] . . . 561μs Sims1 068: RepOrc . . . 28ms Sims1 069: fp example 1 . . . 432μ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 2481μs (452ns 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 . . . 2651μs Sims1 072: symmetric_group(n) for n = 4 . . . 764μs Sims1 073: corner case no generators + no relations . . . 50μs Sims1 076: uninitialized RepOrc . . . 22μs SmallestInteger 001: . . . 8000ns StaticTriVector2 045: all . . . 13μs StaticVector2 043: all . . . 12μs Stephen 000: basic test 1 . . . 220μs Stephen 001: basic test 2 . . . 101μs Stephen 002: full transf monoid . . . 12ms Stephen 003: from step_hen 002 . . . 60μs Stephen 004: from step_hen 003 . . . 160μs Stephen 005: from step_hen 004 . . . 51μs Stephen 006: from step_hen 005 . . . 111μs Stephen 008: C(4) monoid normal form (test_case_knuth_bendix_055) . . . 126μs Stephen 009: C(4) monoid normal form (test_case_gap_smallove [...] . . . 87μs Stephen 010: code coverage . . . 134μs Stephen 011: C(4) monoid normal form (test_case_gap_smallove [...] . . . 283μs Stephen 012: C(4) monoid normal form (test_case_gap_smallove [...] . . . 219μs Stephen 013: C(4) monoid equal to (test_case_gap_smalloverlap_70) . . . 87μs Stephen 014: C(4) monoid normal form (test_case_ex_3_13_14) . . . 403μs Stephen 015: C(4) monoid normal form (test_case_ex_3_15) . . . 532μs Stephen 016: C(4) monoid normal form (test_case_ex_3_16) . . . 315μs Stephen 017: C(4) monoid normal form (test_case_mt_3) . . . 147μs Stephen 018: C(4) monoid normal form (test_case_mt_5) . . . 99μs Stephen 019: C(4) monoid normal form (test_case_mt_6) . . . 297μs Stephen 020: C(4) monoid normal form (test_case_mt_10) . . . 103μs Stephen 021: C(4) monoid normal form (test_case_mt_13) . . . 92μs Stephen 022: C(4) monoid normal form (test_case_mt_14) . . . 100μs Stephen 023: C(4) monoid normal form (test_case_mt_15) . . . 95μs Stephen 024: C(4) monoid normal form (test_case_mt_16) . . . 101μs Stephen 025: C(4) monoid normal form (test_case_mt_17) . . . 323μs Stephen 026: C(4) monoid normal form (test_case_weak_1) . . . 372μs Stephen 027: C(4) monoid normal form (test_case_weak_2) . . . 182μs Stephen 028: C(4) monoid normal form (test_case_weak_3) . . . 189μs Stephen 029: C(4) monoid normal form (test_case_weak_4) . . . 187μs Stephen 030: C(4) monoid normal form (test_case_weak_5) . . . 98μs Stephen 031: Test behaviour when uninitialised . . . 80μs Suf 005: unite . . . 16μs Suf 007: compress . . . 9000ns Suf 011: big chain . . . 13ms Suf 013: empty table . . . 7000ns Suf 015: join . . . 9000ns Suf 017: contains . . . 23μs Suf 019: swap . . . 24μs Timer 001: string method (1 argument) . . . 18μs Timer 002: string method (0 arguments) . . . 10ms Timer 003: reset/elapsed method . . . 20ms Timer 004: operator<< . . . 8000ns ToddCoxeter 000: small 2-sided congruence . . .  -- with HLT + no standardise + full lookahead + no save 1354μs  -- with HLT + standardise + full lookahead + no save 1173μs  -- with HLT + no standardise + partial lookahead + no save 1101μs  -- with HLT + standardise + partial lookahead + no save 932μs  -- with HLT + no standardise + full lookahead + save 933μs  -- with HLT + standardise + full lookahead + save 912μs  -- with HLT + no standardise + partial lookahead + save 920μs  -- with HLT + standardise + partial lookahead + save 943μs  -- with Felsch + no standardisation 910μs  -- with Felsch + standardisation 936μs  -- with random strategy 1021μs  -- with Rc style + full lookahead 942μs  -- with Rc style + partial lookahead 931μs  -- with R/C style 958μs  -- with CR style 927μs  -- with Cr style 921μs ToddCoxeter 001: small 2-sided congruence . . .  -- with HLT + no standardise + full lookahead + no save 4159μs  -- with HLT + standardise + full lookahead + no save 4099μs  -- with HLT + no standardise + partial lookahead + no save 4087μs  -- with HLT + standardise + partial lookahead + no save 4278μs  -- with HLT + no standardise + full lookahead + save 4033μs  -- with HLT + standardise + full lookahead + save 4021μs  -- with HLT + no standardise + partial lookahead + save 4042μs  -- with HLT + standardise + partial lookahead + save 4058μs  -- with Felsch + no standardisation 4058μs  -- with Felsch + standardisation 4041μs  -- with random strategy 4057μs  -- with Rc style + full lookahead 4046μs  -- with Rc style + partial lookahead 3988μs  -- with R/C style 3983μs  -- with CR style 4022μs  -- with Cr style 4060μ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 202μs  -- with HLT + standardise + full lookahead + no save 158μs  -- with HLT + no standardise + partial lookahead + no save 153μs  -- with HLT + standardise + partial lookahead + no save 150μs  -- with HLT + save (throws) 163μs  -- with Felsch (throws) 153μs  -- with random strategy 168μs ToddCoxeter 005: non-trivial two-sided from relations . . .  -- with HLT + no standardise + full lookahead + no save 50μs  -- with HLT + standardise + full lookahead + no save 42μs  -- with HLT + no standardise + partial lookahead + no save 40μs  -- with HLT + standardise + partial lookahead + no save 39μs  -- with HLT + no standardise + full lookahead + save 49μs  -- with HLT + standardise + full lookahead + save 46μs  -- with HLT + no standardise + partial lookahead + save 44μs  -- with HLT + standardise + partial lookahead + save 52μs  -- with Felsch + no standardisation 41μs  -- with Felsch + standardisation 39μs  -- with random strategy 45μs  -- with Rc style + full lookahead 43μs  -- with Rc style + partial lookahead 41μs  -- with R/C style 43μs  -- with CR style 40μs  -- with Cr style 40μs ToddCoxeter 006: small right cong. on free semigroup . . .  -- with HLT + no standardise + full lookahead + no save 36μ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 32μs  -- with HLT + no standardise + full lookahead + save 35μs  -- with HLT + standardise + full lookahead + save 34μs  -- with HLT + no standardise + partial lookahead + save 39μs  -- with HLT + standardise + partial lookahead + save 33μs  -- with Felsch + no standardisation 34μs  -- with Felsch + standardisation 35μs  -- with random strategy 39μs  -- with Rc style + full lookahead 35μs  -- with Rc style + partial lookahead 34μs  -- with R/C style 36μs  -- with CR style 35μs  -- with Cr style 35μs ToddCoxeter 007: left cong. on free semigroup . . .  -- with HLT + no standardise + full lookahead + no save 40μs  -- with HLT + standardise + full lookahead + no save 37μs  -- with HLT + no standardise + partial lookahead + no save 36μs  -- with HLT + standardise + partial lookahead + no save 35μs  -- with HLT + no standardise + full lookahead + save 38μs  -- with HLT + standardise + full lookahead + save 38μs  -- with HLT + no standardise + partial lookahead + save 37μs  -- with HLT + standardise + partial lookahead + save 38μs  -- with Felsch + no standardisation 37μs  -- with Felsch + standardisation 39μs  -- with random strategy 44μs  -- with Rc style + full lookahead 42μs  -- with Rc style + partial lookahead 41μs  -- with R/C style 43μs  -- with CR style 42μs  -- with Cr style 41μs ToddCoxeter 008: for small fp semigroup . . .  -- with HLT + no standardise + full lookahead + no save 36μs  -- with HLT + standardise + full lookahead + no save 32μs  -- with HLT + no standardise + partial lookahead + no save 31μs  -- with HLT + standardise + partial lookahead + no save 32μs  -- with HLT + no standardise + full lookahead + save 34μs  -- with HLT + standardise + full lookahead + save 35μs  -- with HLT + no standardise + partial lookahead + save 33μs  -- with HLT + standardise + partial lookahead + save 33μs  -- with Felsch + no standardisation 33μs  -- with Felsch + standardisation 33μs  -- with random strategy 40μs  -- with Rc style + full lookahead 36μs  -- with Rc style + partial lookahead 36μs  -- with R/C style 37μs  -- with CR style 37μs  -- with Cr style 36μs ToddCoxeter 009: 2-sided cong. trans. semigroup . . .  -- with HLT + no standardise + full lookahead + no save 199μs  -- with HLT + standardise + full lookahead + no save 189μs  -- with HLT + no standardise + partial lookahead + no save 183μs  -- with HLT + standardise + partial lookahead + no save 186μs  -- with HLT + no standardise + full lookahead + save 491μs  -- with HLT + standardise + full lookahead + save 475μs  -- with HLT + no standardise + partial lookahead + save 467μs  -- with HLT + standardise + partial lookahead + save 467μs  -- with Felsch + no standardisation 436μs  -- with Felsch + standardisation 424μs  -- with random strategy 210μs  -- with Rc style + full lookahead 200μs  -- with Rc style + partial lookahead 198μs  -- with R/C style 220μs  -- with CR style 444μs  -- with Cr style 437μs ToddCoxeter 010: left congruence on transformation semigroup . . .  -- with HLT + no standardise + full lookahead + no save 261μs  -- with HLT + standardise + full lookahead + no save 230μs  -- with HLT + no standardise + partial lookahead + no save 218μs  -- with HLT + standardise + partial lookahead + no save 227μs  -- with HLT + no standardise + full lookahead + save 528μs  -- with HLT + standardise + full lookahead + save 526μs  -- with HLT + no standardise + partial lookahead + save 519μs  -- with HLT + standardise + partial lookahead + save 521μs  -- with Felsch + no standardisation 463μs  -- with Felsch + standardisation 442μs  -- with random strategy 604μs  -- with Rc style + full lookahead 269μs  -- with Rc style + partial lookahead 266μs  -- with R/C style 309μs  -- with CR style 508μs  -- with Cr style 500μs ToddCoxeter 011: right cong. trans. semigroup . . .  -- with HLT + no standardise + full lookahead + no save 230μs  -- with HLT + standardise + full lookahead + no save 239μs  -- with HLT + no standardise + partial lookahead + no save 224μs  -- with HLT + standardise + partial lookahead + no save 232μs  -- with HLT + no standardise + full lookahead + save 510μs  -- with HLT + standardise + full lookahead + save 506μs  -- with HLT + no standardise + partial lookahead + save 492μs  -- with HLT + standardise + partial lookahead + save 565μs  -- with Felsch + no standardisation 393μs  -- with Felsch + standardisation 407μs  -- with random strategy 308μs  -- with Rc style + full lookahead 274μs  -- with Rc style + partial lookahead 273μs  -- with R/C style 317μs  -- with CR style 434μs  -- with Cr style 431μs ToddCoxeter 012: trans. semigroup (size 88) . . .  -- with HLT + no standardise + full lookahead + no save 131μs  -- with HLT + standardise + full lookahead + no save 126μs  -- with HLT + no standardise + partial lookahead + no save 123μs  -- with HLT + standardise + partial lookahead + no save 124μs  -- with HLT + save (throws) 132μs  -- with Felsch (throws) 127μs  -- with random strategy 143μs ToddCoxeter 013: left cong. on trans. semigroup (size 88) . . .  -- with HLT + no standardise + full lookahead + no save 199μs  -- with HLT + standardise + full lookahead + no save 205μs  -- with HLT + no standardise + partial lookahead + no save 195μs  -- with HLT + standardise + partial lookahead + no save 202μs  -- with HLT + no standardise + full lookahead + save 513μs  -- with HLT + standardise + full lookahead + save 510μs  -- with HLT + no standardise + partial lookahead + save 531μs  -- with HLT + standardise + partial lookahead + save 506μs  -- with Felsch + no standardisation 446μs  -- with Felsch + standardisation 425μs  -- with random strategy 281μs  -- with Rc style + full lookahead 246μs  -- with Rc style + partial lookahead 243μs  -- with R/C style 289μs  -- with CR style 483μs  -- with Cr style 483μs ToddCoxeter 014: right cong. on trans. semigroup (size 88) . . .  -- with HLT + no standardise + full lookahead + no save 207μs  -- with HLT + standardise + full lookahead + no save 209μs  -- with HLT + no standardise + partial lookahead + no save 199μs  -- with HLT + standardise + partial lookahead + no save 206μs  -- with HLT + no standardise + full lookahead + save 499μs  -- with HLT + standardise + full lookahead + save 488μs  -- with HLT + no standardise + partial lookahead + save 475μs  -- with HLT + standardise + partial lookahead + save 480μs  -- with Felsch + no standardisation 376μs  -- with Felsch + standardisation 386μs  -- with random strategy 286μs  -- with Rc style + full lookahead 252μs  -- with Rc style + partial lookahead 248μs  -- with R/C style 295μs  -- with CR style 411μs  -- with Cr style 403μs ToddCoxeter 015: finite fp-semigroup, dihedral group of order 6 . . .  -- with HLT + no standardise + full lookahead + no save 73μs  -- with HLT + standardise + full lookahead + no save 69μs  -- with HLT + no standardise + partial lookahead + no save 63μs  -- with HLT + standardise + partial lookahead + no save 66μs  -- with HLT + no standardise + full lookahead + save 76μs  -- with HLT + standardise + full lookahead + save 74μs  -- with HLT + no standardise + partial lookahead + save 71μs  -- with HLT + standardise + partial lookahead + save 71μs  -- with Felsch + no standardisation 67μs  -- with Felsch + standardisation 64μs  -- with random strategy 75μs  -- with Rc style + full lookahead 67μs  -- with Rc style + partial lookahead 70μs  -- with R/C style 69μs  -- with CR style 67μs  -- with Cr style 67μs ToddCoxeter 016: finite fp-semigroup, size 16 . . .  -- with HLT + no standardise + full lookahead + no save 67μs  -- with HLT + standardise + full lookahead + no save 64μs  -- with HLT + no standardise + partial lookahead + no save 60μs  -- with HLT + standardise + partial lookahead + no save 62μs  -- with HLT + no standardise + full lookahead + save 124μs  -- with HLT + standardise + full lookahead + save 122μs  -- with HLT + no standardise + partial lookahead + save 116μs  -- with HLT + standardise + partial lookahead + save 118μs  -- with Felsch + no standardisation 109μs  -- with Felsch + standardisation 103μs  -- with random strategy 121μs  -- with Rc style + full lookahead 69μs  -- with Rc style + partial lookahead 70μs  -- with R/C style 78μs  -- with CR style 109μs  -- with Cr style 109μs ToddCoxeter 017: finite fp-semigroup, size 16 . . .  -- with HLT + no standardise + full lookahead + no save 141μs  -- with HLT + standardise + full lookahead + no save 126μs  -- with HLT + no standardise + partial lookahead + no save 116μs  -- with HLT + standardise + partial lookahead + no save 120μs  -- with HLT + no standardise + full lookahead + save 268μs  -- with HLT + standardise + full lookahead + save 256μs  -- with HLT + no standardise + partial lookahead + save 246μs  -- with HLT + standardise + partial lookahead + save 257μs  -- with Felsch + no standardisation 217μs  -- with Felsch + standardisation 212μs  -- with random strategy 245μs  -- with Rc style + full lookahead 129μs  -- with Rc style + partial lookahead 127μs  -- with R/C style 140μs  -- with CR style 223μs  -- with Cr style 220μs ToddCoxeter 018: test lookahead . . .  -- with HLT + no standardise + full lookahead + no save 414μs  -- with HLT + standardise + full lookahead + no save 412μs  -- with HLT + no standardise + partial lookahead + no save 371μs  -- with HLT + standardise + partial lookahead + no save 380μs  -- with HLT + no standardise + full lookahead + save 513μs  -- with HLT + standardise + full lookahead + save 500μs  -- with HLT + no standardise + partial lookahead + save 492μs  -- with HLT + standardise + partial lookahead + save 492μs ToddCoxeter 019: non-trivial left cong. from semigroup . . .  -- with HLT + no standardise + full lookahead + no save 136μs  -- with HLT + standardise + full lookahead + no save 134μs  -- with HLT + no standardise + partial lookahead + no save 125μs  -- with HLT + standardise + partial lookahead + no save 129μs  -- with HLT + save (throws) 131μs  -- with Felsch (throws) 127μs  -- with random strategy 174μs ToddCoxeter 020: 2-sided cong. on free semigroup . . .  -- with HLT + no standardise + full lookahead + no save 22μs  -- with HLT + standardise + full lookahead + no save 18μ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 17μs  -- with HLT + standardise + full lookahead + save 18μs  -- with HLT + no standardise + partial lookahead + save 18μs  -- with HLT + standardise + partial lookahead + save 18μs  -- with Felsch + no standardisation 18μs  -- with Felsch + standardisation 18μs  -- with random strategy 18μs ToddCoxeter 021: calling run when obviously infinite . . .  -- 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 23μs  -- with HLT + standardise + full lookahead + save 28μs  -- with HLT + no standardise + partial lookahead + save 24μs  -- with HLT + standardise + partial lookahead + save 22μs  -- with Felsch + no standardisation 23μs  -- with Felsch + standardisation 23μs  -- with random strategy 23μs ToddCoxeter 022: stellar_monoid S3 . . .  -- with HLT + no standardise + full lookahead + no save 109μs  -- with HLT + standardise + full lookahead + no save 103μs  -- with HLT + no standardise + partial lookahead + no save 95μs  -- with HLT + standardise + partial lookahead + no save 99μs  -- with HLT + no standardise + full lookahead + save 183μs  -- with HLT + standardise + full lookahead + save 179μs  -- with HLT + no standardise + partial lookahead + save 171μs  -- with HLT + standardise + partial lookahead + save 175μs  -- with Felsch + no standardisation 157μs  -- with Felsch + standardisation 149μs  -- with random strategy 180μs  -- with Rc style + full lookahead 112μs  -- with Rc style + partial lookahead 109μs  -- with R/C style 124μs  -- with CR style 164μs  -- with Cr style 162μs ToddCoxeter 023: finite semigroup (size 5) . . .  -- with HLT + no standardise + full lookahead + no save 35μs  -- with HLT + standardise + full lookahead + no save 31μs  -- with HLT + no standardise + partial lookahead + no save 30μs  -- with HLT + standardise + partial lookahead + no save 30μs  -- with HLT + no standardise + full lookahead + save 34μ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 33μs  -- with Felsch + standardisation 34μs  -- with random strategy 38μs  -- with Rc style + full lookahead 33μs  -- with Rc style + partial lookahead 33μs  -- with R/C style 35μs  -- with CR style 35μs  -- with Cr style 34μs ToddCoxeter 024: exceptions . . .  -- with HLT + no standardise + full lookahead + no save 132μs  -- with HLT + standardise + full lookahead + no save 125μs  -- with HLT + no standardise + partial lookahead + no save 118μs  -- with HLT + standardise + partial lookahead + no save 118μs  -- with HLT + no standardise + full lookahead + save 120μs  -- with HLT + standardise + full lookahead + save 119μs  -- with HLT + no standardise + partial lookahead + save 120μs  -- with HLT + standardise + partial lookahead + save 119μs  -- with Felsch + no standardisation 120μs  -- with Felsch + standardisation 120μs  -- with random strategy 128μs  -- with Rc style + full lookahead 120μs  -- with Rc style + partial lookahead 119μs  -- with R/C style 119μs  -- with CR style 121μs  -- with Cr style 120μs ToddCoxeter 025: obviously infinite . . .  -- with HLT + no standardise + full lookahead + no save 44μs  -- with HLT + standardise + full lookahead + no save 41μs  -- with HLT + no standardise + partial lookahead + no save 40μs  -- with HLT + standardise + partial lookahead + no save 41μs  -- with HLT + no standardise + full lookahead + save 42μs  -- with HLT + standardise + full lookahead + save 42μs  -- with HLT + no standardise + partial lookahead + save 41μs  -- with HLT + standardise + partial lookahead + save 41μs  -- with Felsch + no standardisation 42μs  -- with Felsch + standardisation 42μs  -- with random strategy 41μs ToddCoxeter 026: exceptions . . .  -- with HLT + no standardise + full lookahead + no save 80μs  -- with HLT + standardise + full lookahead + no save 72μs  -- with HLT + no standardise + partial lookahead + no save 69μs  -- with HLT + standardise + partial lookahead + no save 69μs  -- with HLT + no standardise + full lookahead + save 73μs  -- with HLT + standardise + full lookahead + save 73μs  -- with HLT + no standardise + partial lookahead + save 72μs  -- with HLT + standardise + partial lookahead + save 71μs  -- with Felsch + no standardisation 71μs  -- with Felsch + standardisation 72μs  -- with random strategy 78μs  -- with Rc style + full lookahead 72μs  -- with Rc style + partial lookahead 71μs  -- with R/C style 81μs  -- with CR style 71μs  -- with Cr style 72μs ToddCoxeter 027: empty . . . 50μs ToddCoxeter 028: congruence of fpsemigroup::ToddCoxeter . . .  -- with HLT + no standardise + full lookahead + no save 106μs  -- with HLT + standardise + full lookahead + no save 86μs  -- with HLT + no standardise + partial lookahead + no save 85μs  -- with HLT + standardise + partial lookahead + no save 86μs  -- with HLT + save (throws) 88μs  -- with Felsch (throws) 86μs  -- with random strategy 91μs  -- with HLT + no standardise + full lookahead + save 87μs  -- with HLT + standardise + full lookahead + save 85μs  -- with HLT + no standardise + partial lookahead + save 88μs  -- with HLT + standardise + partial lookahead + save 86μs  -- with Felsch + no standardisation 85μs  -- with Felsch + standardisation 84μs  -- with Rc style + full lookahead 84μs  -- with Rc style + partial lookahead 83μs  -- with R/C style 84μs  -- with CR style 83μs  -- with Cr style 84μs ToddCoxeter 029: !KnuthBendix.started() . . .  -- with HLT + no standardise + full lookahead + no save and 2-sided 60μs  -- with HLT + standardise + full lookahead + no save and 2-sided 48μs  -- with HLT + no standardise + partial lookahead + no save and 2-sided 48μs  -- with HLT + standardise + partial lookahead + no save and 2-sided 47μs  -- with HLT + no standardise + full lookahead + save and 2-sided 50μs  -- with HLT + standardise + full lookahead + save and 2-sided 49μs  -- with HLT + no standardise + partial lookahead + save and 2-sided 48μs  -- with HLT + standardise + partial lookahead + save and 2-sided 48μs  -- with Felsch + no standardisation and 2-sided 47μs  -- with Felsch + standardisation and 2-sided 47μs  -- with random strategy and 2-sided 51μs  -- with HLT + no standardise + full lookahead + no save and left 49μs  -- with HLT + standardise + full lookahead + no save and left 47μs  -- with HLT + no standardise + partial lookahead + no save and left 47μs  -- with HLT + standardise + partial lookahead + no save and left 51μs  -- with HLT + no standardise + full lookahead + save and left 53μs  -- with HLT + standardise + full lookahead + save and left 53μs  -- with HLT + no standardise + partial lookahead + save and left 52μs  -- with HLT + standardise + partial lookahead + save and left 52μs  -- with Felsch + no standardisation and left 52μs  -- with Felsch + standardisation and left 51μs  -- with random strategy and left 52μs  -- with HLT + no standardise + full lookahead + no save and right 48μs  -- with HLT + standardise + full lookahead + no save and right 46μs  -- with HLT + no standardise + partial lookahead + no save and right 46μs  -- with HLT + standardise + partial lookahead + no save and right 48μs  -- with HLT + no standardise + full lookahead + save and right 60μs  -- with HLT + standardise + full lookahead + save and right 52μs  -- with HLT + no standardise + partial lookahead + save and right 52μs  -- with HLT + standardise + partial lookahead + save and right 51μs  -- with Felsch + no standardisation and right 51μs  -- with Felsch + standardisation and right 51μs  -- with random strategy and right 55μs ToddCoxeter 030: KnuthBendix.finished() . . .  -- with HLT + no standardise + full lookahead + no save and 2-sided 124μs  -- with HLT + standardise + full lookahead + no save and 2-sided 107μs  -- with HLT + no standardise + partial lookahead + no save and 2-sided 104μs  -- with HLT + standardise + partial lookahead + no save and 2-sided 104μs  -- with HLT + no standardise + full lookahead + save and 2-sided 105μs  -- with HLT + standardise + full lookahead + save and 2-sided 104μs  -- with HLT + no standardise + partial lookahead + save and 2-sided 103μs  -- with HLT + standardise + partial lookahead + save and 2-sided 104μs  -- with Felsch + no standardisation and 2-sided 100μs  -- with Felsch + standardisation and 2-sided 99μs  -- with random strategy and 2-sided 116μs  -- with HLT + no standardise + full lookahead + no save and left 106μs  -- with HLT + standardise + full lookahead + no save and left 100μs  -- with HLT + no standardise + partial lookahead + no save and left 98μs  -- with HLT + standardise + partial lookahead + no save and left 100μs  -- with HLT + no standardise + full lookahead + save and left 106μs  -- with HLT + standardise + full lookahead + save and left 106μs  -- with HLT + no standardise + partial lookahead + save and left 105μs  -- with HLT + standardise + partial lookahead + save and left 105μs  -- with Felsch + no standardisation and left 102μs  -- with Felsch + standardisation and left 103μs  -- with random strategy and left 109μs  -- with HLT + no standardise + full lookahead + no save and right 100μs  -- with HLT + standardise + full lookahead + no save and right 98μs  -- with HLT + no standardise + partial lookahead + no save and right 97μs  -- with HLT + standardise + partial lookahead + no save and right 97μs  -- with HLT + no standardise + full lookahead + save and right 114μs  -- with HLT + standardise + full lookahead + save and right 106μs  -- with HLT + no standardise + partial lookahead + save and right 104μs  -- with HLT + standardise + partial lookahead + save and right 104μs  -- with Felsch + no standardisation and right 103μs  -- with Felsch + standardisation and right 101μs  -- with random strategy and right 109μs ToddCoxeter 031: KnuthBendix.finished() . . .  -- with HLT + no standardise + full lookahead + no save and 2-sided 84μs  -- with HLT + standardise + full lookahead + no save and 2-sided 76μs  -- with HLT + no standardise + partial lookahead + no save and 2-sided 74μs  -- with HLT + standardise + partial lookahead + no save and 2-sided 74μs  -- with HLT + no standardise + full lookahead + save and 2-sided 78μs  -- with HLT + standardise + full lookahead + save and 2-sided 76μs  -- with HLT + no standardise + partial lookahead + save and 2-sided 74μs  -- with HLT + standardise + partial lookahead + save and 2-sided 75μs  -- with Felsch + no standardisation and 2-sided 72μs  -- with Felsch + standardisation and 2-sided 71μs  -- with random strategy and 2-sided 79μs  -- with Rc style + full lookahead and 2-sided 77μs  -- with Rc style + partial lookahead and 2-sided 78μs  -- with R/C style and 2-sided 75μs  -- with CR style and 2-sided 74μs  -- with Cr style and 2-sided 78μs  -- with HLT + no standardise + full lookahead + no save and left 76μs  -- with HLT + standardise + full lookahead + no save and left 73μs  -- with HLT + no standardise + partial lookahead + no save and left 74μs  -- with HLT + standardise + partial lookahead + no save and left 72μs  -- with HLT + no standardise + full lookahead + save and left 76μs  -- with HLT + standardise + full lookahead + save and left 77μs  -- with HLT + no standardise + partial lookahead + save and left 75μs  -- with HLT + standardise + partial lookahead + save and left 77μs  -- with Felsch + no standardisation and left 74μs  -- with Felsch + standardisation and left 74μs  -- with random strategy and left 83μs  -- with Rc style + full lookahead and left 77μs  -- with Rc style + partial lookahead and left 76μs  -- with R/C style and left 74μs  -- with CR style and left 77μs  -- with Cr style and left 80μs  -- with HLT + no standardise + full lookahead + no save and right 84μs  -- with HLT + standardise + full lookahead + no save and right 72μs  -- with HLT + no standardise + partial lookahead + no save and right 72μs  -- with HLT + standardise + partial lookahead + no save and right 71μs  -- with HLT + no standardise + full lookahead + save and right 77μs  -- with HLT + standardise + full lookahead + save and right 77μs  -- with HLT + no standardise + partial lookahead + save and right 77μs  -- with HLT + standardise + partial lookahead + save and right 77μs  -- with Felsch + no standardisation and right 74μs  -- with Felsch + standardisation and right 75μs  -- with random strategy and right 87μs  -- with Rc style + full lookahead and right 78μs  -- with Rc style + partial lookahead and right 76μs  -- with R/C style and right 74μs  -- with CR style and right 78μs  -- with Cr style and right 80μs ToddCoxeter 032: prefill . . . 63μs ToddCoxeter 033: congruence of ToddCoxeter . . .  -- with HLT + no standardise + full lookahead + no save 44μs  -- with HLT + standardise + full lookahead + no save 39μs  -- with HLT + no standardise + partial lookahead + no save 36μs  -- with HLT + standardise + partial lookahead + no save 36μs  -- with HLT + no standardise + full lookahead + save 38μs  -- with HLT + standardise + full lookahead + save 38μs  -- with HLT + no standardise + partial lookahead + save 38μs  -- with HLT + standardise + partial lookahead + save 37μs  -- with random strategy 45μs ToddCoxeter 034: congruence of ToddCoxeter . . .  -- with HLT + no standardise + full lookahead + no save 101μs  -- with HLT + standardise + full lookahead + no save 94μs  -- with HLT + no standardise + partial lookahead + no save 93μs  -- with HLT + standardise + partial lookahead + no save 92μs  -- with HLT + save (throws) 96μs  -- with Felsch (throws) 94μs  -- with random strategy 97μs ToddCoxeter 035: congruence on FpSemigroup . . .  -- with HLT + no standardise + full lookahead + no save 245μs  -- with HLT + standardise + full lookahead + no save 215μs  -- with HLT + no standardise + partial lookahead + no save 207μs  -- with HLT + standardise + partial lookahead + no save 212μs  -- with HLT + no standardise + full lookahead + save 230μs  -- with HLT + standardise + full lookahead + save 230μs  -- with HLT + no standardise + partial lookahead + save 223μs  -- with HLT + standardise + partial lookahead + save 223μs  -- with Felsch + no standardisation 220μs  -- with Felsch + standardisation 218μs  -- with random strategy 228μs  -- with Rc style + full lookahead 203μs  -- with Rc style + partial lookahead 202μs  -- with R/C style 203μs  -- with CR style 221μs  -- with Cr style 221μs ToddCoxeter 036: exceptions . . . 71μs ToddCoxeter 037: copy constructor . . . 25μs ToddCoxeter 038: simplify . . . 87μs ToddCoxeter 039: stylic_monoid . . . 879ms ToddCoxeter 041: some finite classes . . . 345μs ToddCoxeter 043: symmetric_group(7, Coxeter + Moser) . . . 139ms ToddCoxeter 044: Option exceptions . . . 48μs ToddCoxeter 045: Options operator<< . . . 444μs ToddCoxeter 046: Easdown-East-FitzGerald DualSymInv(5) . . .  -- with HLT + no standardise + full lookahead + no save 178ms  -- with HLT + standardise + full lookahead + no save 196ms  -- with HLT + no standardise + partial lookahead + no save 179ms  -- with HLT + standardise + partial lookahead + no save 197ms  -- with HLT + no standardise + full lookahead + save 117ms  -- with HLT + standardise + full lookahead + save 117ms  -- with HLT + no standardise + partial lookahead + save 117ms  -- with HLT + standardise + partial lookahead + save 117ms  -- with Felsch + no standardisation 128ms  -- with Felsch + standardisation 127ms  -- with random strategy 192ms  -- with R/C style 190ms  -- with Rc style + full lookahead 135ms  -- with Rc style + partial lookahead 135ms ToddCoxeter 047: uniform_block_bijection_monoid(3) (FitzGerald) . . .  -- with HLT + no standardise + full lookahead + no save 103μs  -- with HLT + standardise + full lookahead + no save 96μs  -- with HLT + no standardise + partial lookahead + no save 88μs  -- with HLT + standardise + partial lookahead + no save 90μs  -- with HLT + no standardise + full lookahead + save 158μs  -- with HLT + standardise + full lookahead + save 151μs  -- with HLT + no standardise + partial lookahead + save 147μs  -- with HLT + standardise + partial lookahead + save 146μs  -- with Felsch + no standardisation 117μs  -- with Felsch + standardisation 111μs  -- with random strategy 150μs  -- with R/C style 107μs  -- with Rc style + full lookahead 95μs  -- with Rc style + partial lookahead 93μs ToddCoxeter 048: stellar_monoid(7) (Gay-Hivert) . . . 133ms ToddCoxeter 049: partition_monoid(4) (East) . . .  -- with HLT + no standardise + full lookahead + no save 30ms  -- 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 46ms  -- with HLT + standardise + full lookahead + save 47ms  -- with HLT + no standardise + partial lookahead + save 46ms  -- with HLT + standardise + partial lookahead + save 47ms  -- with Felsch + no standardisation 55ms  -- with Felsch + standardisation 55ms  -- with random strategy 60ms  -- with R/C style 35ms  -- with Rc style + full lookahead 61ms  -- with Rc style + partial lookahead 61ms ToddCoxeter 050: singular_brauer_monoid(6) (Maltcev + Mazorchuk) . . . 505ms ToddCoxeter 051: orientation_preserving_monoid(6) (Ruskuc + [...] . . .  -- with HLT + no standardise + full lookahead + no save 21ms ToddCoxeter 052: orientation_reversing_monoid(5) (Ruskuc + [...] . . .  -- with HLT + no standardise + full lookahead + no save 5574μs ToddCoxeter 053: temperley_lieb_monoid(10) (East) . . . 39ms ToddCoxeter 063: add_rule . . .  -- with HLT + no standardise + full lookahead + no save 93μs  -- with HLT + standardise + full lookahead + no save 73μs  -- with HLT + no standardise + partial lookahead + no save 72μs  -- with HLT + standardise + partial lookahead + no save 70μs  -- with HLT + no standardise + full lookahead + save 74μs  -- with HLT + standardise + full lookahead + save 73μs  -- with HLT + no standardise + partial lookahead + save 79μs  -- with HLT + standardise + partial lookahead + save 71μs  -- with Felsch + no standardisation 74μs  -- with Felsch + standardisation 70μs  -- with random strategy 76μs  -- with Rc style + full lookahead 72μs  -- with Rc style + partial lookahead 72μs  -- with R/C style 74μs  -- with CR style 73μs  -- with Cr style 73μs  -- with R/C + Felsch lookahead 78μs  -- with HLT + Felsch lookahead + save 70μs  -- with Cr + small number of f_defs 75μs  -- with Rc + small number of deductions 72μs  -- with Felsch + v2 + no preferred defs 70μs  -- with Felsch + v2 + immediate no stack 71μs  -- with Felsch + v1 + immediate no stack 72μs  -- with Felsch + v1 + immediate yes stack 71μs  -- with large collapse 74μs ToddCoxeter 064: (from kbmag/standalone/kb_data/s4) (KnuthB [...] . . .  -- with HLT + no standardise + full lookahead + no save 228μs ToddCoxeter 066: test validate . . . 30μs ToddCoxeter 067: add_rules after construct. from semigroup . . .  -- with HLT + no standardise + full lookahead + no save 329μs  -- with HLT + standardise + full lookahead + no save 291μs  -- with HLT + no standardise + partial lookahead + no save 290μs  -- with HLT + standardise + partial lookahead + no save 285μs  -- with HLT + save (throws) 290μs  -- with Felsch (throws) 298μs  -- with random strategy 299μs ToddCoxeter 068: Sym(5) from Chapter 3, Proposition 1.1 in NR . . .  -- with Deduction policy == purge_from_top 644μs  -- with Deduction policy == purge_all 612μs  -- with Deduction policy == discard_all_if_no_space 661μs  -- with HLT + no standardise + full lookahead + no save 812μs  -- with HLT + standardise + full lookahead + no save 1076μs  -- with HLT + no standardise + partial lookahead + no save 793μs  -- with HLT + standardise + partial lookahead + no save 1048μs  -- with HLT + no standardise + full lookahead + save 977μs  -- with HLT + standardise + full lookahead + save 974μs  -- with HLT + no standardise + partial lookahead + save 947μs  -- with HLT + standardise + partial lookahead + save 977μs  -- with Felsch + no standardisation 636μs  -- with Felsch + standardisation 621μs  -- with random strategy 722μs  -- with Rc style + full lookahead 1396μs  -- with Rc style + partial lookahead 1375μs  -- with R/C style 919μs  -- with CR style 696μs  -- with Cr style 685μs ToddCoxeter 069: Chapter 7, Theorem 3.6 in NR (size 243) . . .  -- with HLT + no standardise + full lookahead + no save 651μs  -- with HLT + standardise + full lookahead + no save 698μs  -- with HLT + no standardise + partial lookahead + no save 644μs  -- with HLT + standardise + partial lookahead + no save 690μs  -- with HLT + no standardise + full lookahead + save 567μs  -- with HLT + standardise + full lookahead + save 583μs  -- with HLT + no standardise + partial lookahead + save 556μs  -- with HLT + standardise + partial lookahead + save 582μs  -- with Felsch + no standardisation 2951μs  -- with Felsch + standardisation 2945μs  -- with random strategy 727μs  -- with Rc style + full lookahead 730μs  -- with Rc style + partial lookahead 728μs  -- with R/C style 808μs  -- with CR style 2975μs  -- with Cr style 2978μs ToddCoxeter 070: finite semigroup (size 99) . . .  -- with HLT + no standardise + full lookahead + no save 278μs  -- with HLT + standardise + full lookahead + no save 285μs  -- with HLT + no standardise + partial lookahead + no save 268μs  -- with HLT + standardise + partial lookahead + no save 286μs  -- with HLT + no standardise + full lookahead + save 237μs  -- with HLT + standardise + full lookahead + save 243μs  -- with HLT + no standardise + partial lookahead + save 228μs  -- with HLT + standardise + partial lookahead + save 239μs  -- with Felsch + no standardisation 537μs  -- with Felsch + standardisation 540μs  -- with random strategy 693μs  -- with Rc style + full lookahead 304μs  -- with Rc style + partial lookahead 301μs  -- with R/C style 336μs  -- with CR style 565μs  -- with Cr style 561μs ToddCoxeter 080: KnuthBendix 098 . . .  -- with HLT + no standardise + full lookahead + no save 1010ms  -- with HLT + standardise + full lookahead + no save 989ms  -- with HLT + no standardise + partial lookahead + no save 1020ms  -- with HLT + standardise + partial lookahead + no save 990ms  -- with HLT + no standardise + full lookahead + save 426ms  -- with HLT + standardise + full lookahead + save 430ms  -- with HLT + no standardise + partial lookahead + save 428ms  -- with HLT + standardise + partial lookahead + save 429ms  -- with Felsch + no standardisation 405ms  -- with Felsch + standardisation 402ms  -- with random strategy 425ms  -- with Rc style + full lookahead 397ms  -- with Rc style + partial lookahead 400ms  -- with R/C style 1021ms  -- with CR style 405ms  -- with Cr style 403ms ToddCoxeter 084: Campbell-Reza 1 . . .  -- with HLT + no standardise + full lookahead + no save 112μs  -- with HLT + standardise + full lookahead + no save 85μs  -- with HLT + no standardise + partial lookahead + no save 69μs  -- with HLT + standardise + partial lookahead + no save 74μs  -- with HLT + no standardise + full lookahead + save 85μs  -- with HLT + standardise + full lookahead + save 78μs  -- with HLT + no standardise + partial lookahead + save 77μs  -- with HLT + standardise + partial lookahead + save 78μs  -- with Felsch + no standardisation 87μs  -- with Felsch + standardisation 82μs  -- with random strategy 80μs  -- with Rc style + full lookahead 72μs  -- with Rc style + partial lookahead 71μs  -- with R/C style 75μs  -- with CR style 86μs  -- with Cr style 88μs ToddCoxeter 085: Renner monoid type D4 (Gay-Hivert), q = 1 . . .  -- with HLT + no standardise + full lookahead + no save 101ms  -- with HLT + standardise + full lookahead + no save 104ms  -- with HLT + no standardise + partial lookahead + no save 104ms  -- with HLT + standardise + partial lookahead + no save 101ms  -- with HLT + no standardise + full lookahead + save 101ms  -- with HLT + standardise + full lookahead + save 103ms  -- with HLT + no standardise + partial lookahead + save 101ms  -- with HLT + standardise + partial lookahead + save 105ms  -- with Felsch + no standardisation 101ms  -- with Felsch + standardisation 101ms  -- with random strategy 101ms  -- with Rc style + full lookahead 101ms  -- with Rc style + partial lookahead 104ms  -- with R/C style 101ms  -- with CR style 105ms  -- with Cr style 106ms ToddCoxeter 086: trivial semigroup . . . 232ms ToddCoxeter 092: ACE --- perf602p5 - HLT . . .  -- with HLT + no standardise + full lookahead + no save 32ms  -- with HLT + standardise + full lookahead + no save 32ms  -- with HLT + no standardise + partial lookahead + no save 32ms  -- with HLT + standardise + partial lookahead + no save 32ms  -- with HLT + no standardise + full lookahead + save 13ms  -- with HLT + standardise + full lookahead + save 14ms  -- with HLT + no standardise + partial lookahead + save 13ms  -- with HLT + standardise + partial lookahead + save 13ms  -- with random strategy 33ms  -- with Felsch + no standardisation 10ms  -- with Felsch + standardisation 10ms ToddCoxeter 094: ACE --- C5 - HLT . . .  -- with HLT + no standardise + full lookahead + no save 75μs  -- with HLT + standardise + full lookahead + no save 66μs  -- with HLT + no standardise + partial lookahead + no save 64μs  -- with HLT + standardise + partial lookahead + no save 63μs  -- with HLT + no standardise + full lookahead + save 77μs  -- with HLT + standardise + full lookahead + save 76μs  -- with HLT + no standardise + partial lookahead + save 74μs  -- with HLT + standardise + partial lookahead + save 74μs  -- with random strategy 75μs  -- with Felsch + no standardisation 70μs  -- with Felsch + standardisation 68μs ToddCoxeter 095: ACE --- A5-C5 . . .  -- with HLT + no standardise + full lookahead + no save 91μs  -- with HLT + standardise + full lookahead + no save 96μs  -- with HLT + no standardise + partial lookahead + no save 86μs  -- with HLT + standardise + partial lookahead + no save 96μs  -- with HLT + no standardise + full lookahead + save 116μs  -- with HLT + standardise + full lookahead + save 110μs  -- with HLT + no standardise + partial lookahead + save 108μs  -- with HLT + standardise + partial lookahead + save 109μs  -- with random strategy 131μs  -- with Felsch + no standardisation 97μs  -- with Felsch + standardisation 95μs ToddCoxeter 096: ACE --- A5 . . .  -- with HLT + no standardise + full lookahead + no save 232μs  -- with HLT + standardise + full lookahead + no save 270μs  -- with HLT + no standardise + partial lookahead + no save 202μs  -- with HLT + standardise + partial lookahead + no save 268μs  -- with HLT + no standardise + full lookahead + save 306μs  -- with HLT + standardise + full lookahead + save 310μs  -- with HLT + no standardise + partial lookahead + save 296μs  -- with HLT + standardise + partial lookahead + save 307μs  -- with random strategy 264μs  -- with Felsch + no standardisation 222μs  -- with Felsch + standardisation 217μs ToddCoxeter 098: relation ordering . . .  -- with Felsch + no standardisation 472μs  -- with Felsch + standardisation 428μs  -- with HLT + no standardise + full lookahead + no save 232μs  -- with HLT + standardise + full lookahead + no save 230μs  -- with HLT + no standardise + partial lookahead + no save 227μs  -- with HLT + standardise + partial lookahead + no save 225μs  -- with HLT + no standardise + full lookahead + save 448μs  -- with HLT + standardise + full lookahead + save 443μs  -- with HLT + no standardise + partial lookahead + save 444μs  -- with HLT + standardise + partial lookahead + save 451μs  -- with random strategy 484μs ToddCoxeter 099: short circuit size in obviously infinite . . . 14μs ToddCoxeter 101: http://brauer.maths.qmul.ac.uk/Atlas/spor/M [...] . . . 600ms ToddCoxeter 108: http://brauer.maths.qmul.ac.uk/Atlas/lin/L3 [...] . . . 544ms ToddCoxeter 110: to_gap_string . . . 49μs ToddCoxeter 111: partition_monoid(2) . . . 53μs ToddCoxeter 112: brauer_monoid(4) (Kudryavtseva + Mazorchuk) . . . 371μs ToddCoxeter 113: symmetric_inverse_monoid . . . 16ms ToddCoxeter 116: symmetric_group(7, Burnside + Miller) . . . 440ms UF 001: constructor by size . . . 11μs UF 002: copy constructor . . . 13μs UF 003: find . . . 12μs Ukkonen 000: basic tests . . . 53ms Ukkonen 001: maximal_piece_prefix 1 . . . 24μs Ukkonen 002: maximal_piece_prefix 2 . . . 28μs Ukkonen 003: maximal_piece_prefix 3 . . . 175μs Ukkonen 004: number_of_pieces . . . 52μs Ukkonen 005: traverse . . . 15μs Ukkonen 006: dot . . . 125μs Ukkonen 007: strings . . . 35μs Ukkonen 008: dfs #01 . . . 24μs Ukkonen 009: dfs #02 . . . 22μs Ukkonen 010: dfs #03 . . . 22μs Ukkonen 011: dfs #04 . . . 52μs Ukkonen 012: dfs #05 . . . 39μs Ukkonen 013: dfs #06 . . . 35μs Ukkonen 014: dfs #07 . . . 73μs Ukkonen 015: dfs #08 . . . 49μs Ukkonen 016: dfs #09 . . . 70μs Ukkonen 017: dfs #10 . . . 21μs Ukkonen 018: pieces . . . 26μs Ukkonen 019: code coverage . . . 34μs Ukkonen 020: code coverage . . . 8000ns action_digraph_helper 015: detail::to_string . . . 16μs action_digraph_helper 016: make . . . 22μs action_digraph_helper 017: is_connected . . . 146μs action_digraph_helper 018: is_strictly_cyclic . . . 10ms follow_path 012: 20 node path . . . 16μs fpsemi-examples 002: full_transformation_monoid author except . . . 21μs fpsemi-examples 003: full_transformation_monoid degree except . . . 15μs fpsemi-examples 005: partial_transformation_monoid author except . . . 21μs fpsemi-examples 006: partial_transformation_monoid degree except . . . 19μs fpsemi-examples 007: symmetric_inverse_monoid(5) . . . 16ms fpsemi-examples 008: symmetric_group auth except . . . 31μs fpsemi-examples 009: symmetric_group degree except . . . 19μs fpsemi-examples 010: symmetric_group(6) Burnside + Miller . . . 25ms fpsemi-examples 011: dual_symmetric_inverse_monoid(5) . . . 180ms fpsemi-examples 012: dual_symmetric_inverse_monoid auth except . . . 31μs fpsemi-examples 013: dual_symmetric_inverse_monoid degree except . . . 18μs fpsemi-examples 014: uniform_block_bijection_monoid(5) . . . 13ms fpsemi-examples 015: uniform_block_bijection_monoid auth except . . . 22μs fpsemi-examples 016: uniform_block_bijection_monoid degree except . . . 14μs fpsemi-examples 019: partition_monoid auth except . . . 59μs fpsemi-examples 020: partition_monoid degree except . . . 55μs fpsemi-examples 022: monogenic_semigroup(4, 9) . . . 30μs fpsemi-examples 023: fibonacci_semigroup(2, 5) . . . 64μs fpsemi-examples 024: temperley_lieb_monoid(10) . . . 47ms fpsemi-examples 025: singular_brauer_monoid(6) . . . 414ms fpsemi-examples 026: orientation_preserving_monoid(6) . . . 21ms fpsemi-examples 027: orientation_reversing_monoid(5) . . . 5622μs fpsemi-examples 028: chinese_monoid(3) . . . 117μs fpsemi-examples 029: plactic_monoid(3) . . . 96μs fpsemi-examples 030: stylic_monoid(3) . . . 888μs fpsemi-examples 031: symmetric_group(6) Carmichael . . . 12ms fpsemi-examples 032: symmetric_group(6) Moore index 0 . . . 9275μs fpsemi-examples 033: symmetric_group(6) Coxeter + Moser . . . 6836μs fpsemi-examples 034: test for the rook monoid . . . 295μs fpsemi-examples 035: alternating_group(7) Moore . . . 26ms fpsemi-examples 036: alternating_group auth except . . . 28μs fpsemi-examples 037: alternating_group degree except . . . 14μs fpsemi-examples 038: partial_transformation_monoid(3) Machine . . . 256μs fpsemi-examples 039: chinese_monoid degree except . . . 18μs fpsemi-examples 040: monogenic_semigroup degree except . . . 17μs fpsemi-examples 041: rectangular_band degree except . . . 28μs fpsemi-examples 042: stellar_monoid degree except . . . 17μs fpsemi-examples 043: plactic_monoid degree except . . . 16μs fpsemi-examples 044: stylic_monoid degree except . . . 15μs fpsemi-examples 045: temperley_lieb_monoid degree except . . . 21μs fpsemi-examples 046: singular_brauer_monoid degree except . . . 23μs fpsemi-examples 047: orientation_preserving_monoid degree except . . . 25μs fpsemi-examples 048: orientation_reversing_monoid degree except . . . 28μs fpsemi-examples 049: test default values . . . 2183μs fpsemi-examples 052: not_symmetric_group(5) Guralnick + Kant [...] . . . 2269μs fpsemi-examples 053: order_preserving_monoid(5) . . . 775μs fpsemi-examples 055: order_preserving_monoid degree except . . . 28μs fpsemi-examples 056: cyclic_inverse_monoid(4) Fernandes 1 . . . 213μs fpsemi-examples 057: cyclic_inverse_monoid(8) Fernandes index 1 . . . 12ms fpsemi-examples 058: cyclic_inverse_monoid Fernandes index 0 . . . 27ms fpsemi-examples 059: order_preserving_cyclic_inverse_monoid(4) . . . 139μs fpsemi-examples 060: order_preserving_cyclic_inverse_monoid(10) . . . 31ms fpsemi-examples 061: cyclic_inverse_monoid degree except . . . 60μs fpsemi-examples 062: cyclic_inverse_monoid author except . . . 24μs fpsemi-examples 063: order_preserving_monoid degree except . . . 23μs fpsemi-examples 064: symmetric_group index except . . . 28μs fpsemi-examples 065: symmetric_group(7) Moore index 1 . . . 7744μs fpsemi-examples 066: order_preserving_cyclic_inverse_monoid(10) . . . 31ms fpsemi-examples 067: partial_isometries_cycle_graph_monoid(5) . . . 641μs fpsemi-examples 068: partial_isometries_cycle_graph_monoid(10) . . . 193ms fpsemi-examples 069: partial_isometries_cycle_graph_monoid d [...] . . . 44μs fpsemi-examples 070: partial_isometries_cycle_graph_monoid(4) . . . 291μs freeband_equal_to 001: . . . 544μs is_acyclic 000: 2-cycle . . . 8000ns is_acyclic 001: 1-cycle . . . 7000ns is_acyclic 002: multi-digraph . . . 9000ns is_acyclic 003: complete digraph 100 . . . 67μs is_acyclic 004: acyclic digraph with 20000 nodes . . . 1420μs is_acyclic 006: for a node . . . 804μs is_acyclic 007: for a node . . . 13μs is_reachable 008: acyclic 20 node digraph . . . 26μs is_reachable 009: 100 node path . . . 9027μs is_reachable 010: 100 node cycle . . . 8253μs is_reachable 011: 20 node clique . . . 456μs last_node_on_path_nc 014: 20 node path . . . 12μs make 000: from FroidurePin . . . 350μs make 001: from FroidurePin and alphabet . . . 402μs make 002: presentation from presentation . . . 109μs make 003: presentation from presentation and alphabet . . . 26μs make 004: argument checks issue . . . 55μs make 005: use human readable alphabet for make . . . 13μs make> 000: from ActionDigraph . . . 1213μs make> 001: from ActionDigraph (exceptions) . . . 27μs number_of_words 001: . . . 10μs operator"" _w 003: literal . . . 11μs silo 000: alphabet: a, min: 0, max: 10 . . . 24μs silo 001: corner cases . . . 19μs silo 002: alphabet: ab, min: 1, max: 4 . . . 29μs silo 003: alphabet: abc, min: 0, max: 13 . . . 70ms silo 004: code coverage . . . 17μs sislo 005: alphabet: a, min: 0, max: 10 . . . 23μs sislo 006: corner cases . . . 56μs sislo 007: alphabet: ab, min: 1, max: 4 . . . 49μs sislo 008: alphabet: abc, min: 0, max: 13 . . . 70ms sislo 009: code coverage . . . 17μs string 000: detail::is_suffix . . . 10μs string 001: detail::is_prefix . . . 9000ns string 002: detail::maximum_common_suffix . . . 8000ns string 003: detail::group_digits . . . 16μs string_to_word 002: . . . 8000ns validate_label 013: 20 node path . . . 26μs wilo 001: corner cases . . . 23μs wilo 002: letters: 2, min: 1, max: 4 . . . 22μs wilo 003: letters: 2, min: 1, max: 4 . . . 35μs wilo 004: letters: 3, min: 0, max: 10 . . . 13ms wilo 005: letters: 3, min: 0, max: 13 . . . 100ms wilo 006: forward iterator requirements . . . 101ms wilo 007: more corner cases . . . 32μs wilo 008: starting at a given word 1 . . . 73μs wilo 009: starting at a given word 2 . . . 13μs wilo 010: code coverage . . . 12μs wislo 000: n: 2, min; 1, max: 4 . . . 16μs wislo 001: corner cases . . . 26μs wislo 002: n: 3, min; 0, max: 10 . . . 3377μs wislo 003: n: 3, min; 0, max: 13 . . . 99ms wislo 004: lex + sort . . . 374ms wislo 005: code coverage . . . 19μ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-dev*: Scanning shared objects >>> libsemigroups-static*: Scanning shared objects >>> libsemigroups*: Scanning shared objects >>> libsemigroups-dev*: Tracing dependencies... libsemigroups=2.7.3-r1 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-r1.apk >>> libsemigroups-static*: Tracing dependencies... >>> libsemigroups-static*: Package size: 3.8 MB >>> libsemigroups-static*: Compressing data... >>> libsemigroups-static*: Create checksum... >>> libsemigroups-static*: Create libsemigroups-static-2.7.3-r1.apk >>> libsemigroups*: Tracing dependencies... so:libc.musl-armv7.so.1 so:libfmt.so.11 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-r1.apk >>> libsemigroups: Build complete at Sat, 14 Dec 2024 19:17:49 +0000 elapsed time 0h 22m 37s >>> libsemigroups: Cleaning up srcdir >>> libsemigroups: Cleaning up pkgdir >>> libsemigroups: Uninstalling dependencies... (1/4) Purging .makedepends-libsemigroups (20241214.185513) (2/4) Purging eigen-dev (3.4.0-r10) (3/4) Purging fmt-dev (11.0.2-r0) (4/4) Purging fmt (11.0.2-r0) OK: 275 MiB in 101 packages >>> libsemigroups: Updating the testing/armv7 repository index... >>> libsemigroups: Signing the index...