* installing *source* package ‘MultiBD’ ... ** this is package ‘MultiBD’ version ‘1.0.0’ ** package ‘MultiBD’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (GCC) 15.1.1 20250521 (Red Hat 15.1.1-2)’ make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-CXX20/MultiBD/src' g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c BidBj_Cpp.cpp -o BidBj_Cpp.o g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c RcppExports.cpp -o RcppExports.o In file included from BidBj_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c SEIR_Cpp.cpp -o SEIR_Cpp.o In file included from SEIR_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c SIR_Cpp.cpp -o SIR_Cpp.o In file included from SIR_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c bb_lt_Cpp.cpp -o bb_lt_Cpp.o In file included from bb_lt_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c bb_lt_invert_Cpp.cpp -o bb_lt_invert_Cpp.o In file included from bb_lt_invert_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture bbd.h: In instantiation of ‘UnaryFunction loops::TbbThreads::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::TbbThreads&)::]’: bb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::TbbThreads]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(Ap1*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ bb_lt_invert_Cpp.cpp:95:37: required from here 95 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | nblocks, tol, Lmax, loopTbbThreads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:260:29: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 260 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::TbbThreads::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::TbbThreads&)::::]’: bb_lt_invert_Cpp.cpp:60:26: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::TbbThreads]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ bb_lt_invert_Cpp.cpp:95:37: required from here 95 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | nblocks, tol, Lmax, loopTbbThreads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:260:29: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 260 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Threads::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::C11Threads&)::]’: bb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Threads]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(Ap1*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ bb_lt_invert_Cpp.cpp:104:37: required from here 104 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 105 | nblocks, tol, Lmax, loopC11Threads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:301:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 301 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:317:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 317 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Threads::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::C11Threads&)::::]’: bb_lt_invert_Cpp.cpp:60:26: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Threads]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ bb_lt_invert_Cpp.cpp:104:37: required from here 104 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 105 | nblocks, tol, Lmax, loopC11Threads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:301:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 301 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:317:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 317 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11ThreadPool::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::C11ThreadPool&)::]’: bb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11ThreadPool]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(Ap1*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ bb_lt_invert_Cpp.cpp:111:37: required from here 111 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 112 | nblocks, tol, Lmax, loopC11ThreadPool); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:384:43: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 384 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11ThreadPool::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::C11ThreadPool&)::::]’: bb_lt_invert_Cpp.cpp:60:26: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11ThreadPool]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ bb_lt_invert_Cpp.cpp:111:37: required from here 111 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 112 | nblocks, tol, Lmax, loopC11ThreadPool); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:384:43: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 384 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Async::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::C11Async&)::]’: bb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Async]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(Ap1*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ bb_lt_invert_Cpp.cpp:118:37: required from here 118 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 119 | nblocks, tol, Lmax, loopC11Async); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:342:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 342 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:359:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 359 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Async::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, loops::C11Async&)::::]’: bb_lt_invert_Cpp.cpp:60:26: required from ‘std::vector bb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Async]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | bb_lt_Cpp(s,lambda1,lambda2,Ap1,Bp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ bb_lt_invert_Cpp.cpp:118:37: required from here 118 | return bb_lt_invert_Cpp_impl(t, lambda1, lambda2, Ap1, Bp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 119 | nblocks, tol, Lmax, loopC11Async); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:342:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 342 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:359:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 359 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bb_lt_invert_Cpp.cpp: In lambda function: bb_lt_invert_Cpp.cpp:71:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bb_lt_invert_Cpp.cpp:47:17: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ bb_lt_invert_Cpp.cpp: In lambda function: bb_lt_invert_Cpp.cpp:71:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bb_lt_invert_Cpp.cpp:47:17: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ bb_lt_invert_Cpp.cpp: In lambda function: bb_lt_invert_Cpp.cpp:71:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bb_lt_invert_Cpp.cpp:47:17: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ bb_lt_invert_Cpp.cpp: In lambda function: bb_lt_invert_Cpp.cpp:71:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bb_lt_invert_Cpp.cpp:47:17: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ bb_lt_invert_Cpp.cpp: In lambda function: bb_lt_invert_Cpp.cpp:71:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bb_lt_invert_Cpp.cpp:47:17: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c bbd_lt_Cpp.cpp -o bbd_lt_Cpp.o In file included from bbd_lt_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c bbd_lt_invert_Cpp.cpp -o bbd_lt_invert_Cpp.o In file included from bbd_lt_invert_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture bbd_lt_invert_Cpp.cpp: In instantiation of ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::TbbThreads]’: bbd_lt_invert_Cpp.cpp:122:38: required from here 122 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 123 | maxdepth, nblocks, tol, loopTbbThreads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd_lt_invert_Cpp.cpp:25:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 25 | for (int i = 0; i < size; ++i) { | ~~^~~~~~ bbd_lt_invert_Cpp.cpp: In instantiation of ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Threads]’: bbd_lt_invert_Cpp.cpp:131:38: required from here 131 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 132 | maxdepth, nblocks, tol, loopC11Threads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd_lt_invert_Cpp.cpp:25:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 25 | for (int i = 0; i < size; ++i) { | ~~^~~~~~ bbd_lt_invert_Cpp.cpp: In instantiation of ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11ThreadPool]’: bbd_lt_invert_Cpp.cpp:138:38: required from here 138 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 139 | maxdepth, nblocks, tol, loopC11ThreadPool); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd_lt_invert_Cpp.cpp:25:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 25 | for (int i = 0; i < size; ++i) { | ~~^~~~~~ bbd_lt_invert_Cpp.cpp: In instantiation of ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Async]’: bbd_lt_invert_Cpp.cpp:145:38: required from here 145 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 146 | maxdepth, nblocks, tol, loopC11Async); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd_lt_invert_Cpp.cpp:25:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 25 | for (int i = 0; i < size; ++i) { | ~~^~~~~~ bbd_lt_invert_Cpp.cpp: In instantiation of ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::STL]’: bbd_lt_invert_Cpp.cpp:159:38: required from here 159 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 160 | maxdepth, nblocks, tol, loopSTL); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd_lt_invert_Cpp.cpp:25:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 25 | for (int i = 0; i < size; ++i) { | ~~^~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::TbbThreads::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::TbbThreads&)::]’: bbd_lt_invert_Cpp.cpp:51:18: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::TbbThreads]’ 51 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(kmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 52 | [&](int w) { | ~~~~~~~~~~~~ 53 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 54 | ig[w].resize((A+1-a0)*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 55 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)],prod_mu2,prod_lambda2,xvec,yvec_minus_s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 56 | yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)],inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 57 | }); | ~~ bbd_lt_invert_Cpp.cpp:122:38: required from here 122 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 123 | maxdepth, nblocks, tol, loopTbbThreads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:260:29: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 260 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::TbbThreads::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::TbbThreads&)::::]’: bbd_lt_invert_Cpp.cpp:85:26: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::TbbThreads]’ 85 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 86 | [&](int w) { | ~~~~~~~~~~~~ 87 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+kmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 88 | ig[w+kmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 89 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 90 | prod_mu2,prod_lambda2,xvec,yvec_minus_s,yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w+kmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | }); | ~~ bbd_lt_invert_Cpp.cpp:122:38: required from here 122 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 123 | maxdepth, nblocks, tol, loopTbbThreads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:260:29: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 260 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Threads::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::C11Threads&)::]’: bbd_lt_invert_Cpp.cpp:51:18: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Threads]’ 51 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(kmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 52 | [&](int w) { | ~~~~~~~~~~~~ 53 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 54 | ig[w].resize((A+1-a0)*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 55 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)],prod_mu2,prod_lambda2,xvec,yvec_minus_s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 56 | yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)],inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 57 | }); | ~~ bbd_lt_invert_Cpp.cpp:131:38: required from here 131 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 132 | maxdepth, nblocks, tol, loopC11Threads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:301:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 301 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:317:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 317 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Threads::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::C11Threads&)::::]’: bbd_lt_invert_Cpp.cpp:85:26: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Threads]’ 85 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 86 | [&](int w) { | ~~~~~~~~~~~~ 87 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+kmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 88 | ig[w+kmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 89 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 90 | prod_mu2,prod_lambda2,xvec,yvec_minus_s,yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w+kmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | }); | ~~ bbd_lt_invert_Cpp.cpp:131:38: required from here 131 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 132 | maxdepth, nblocks, tol, loopC11Threads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:301:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 301 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:317:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 317 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11ThreadPool::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::C11ThreadPool&)::]’: bbd_lt_invert_Cpp.cpp:51:18: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11ThreadPool]’ 51 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(kmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 52 | [&](int w) { | ~~~~~~~~~~~~ 53 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 54 | ig[w].resize((A+1-a0)*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 55 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)],prod_mu2,prod_lambda2,xvec,yvec_minus_s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 56 | yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)],inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 57 | }); | ~~ bbd_lt_invert_Cpp.cpp:138:38: required from here 138 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 139 | maxdepth, nblocks, tol, loopC11ThreadPool); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:384:43: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 384 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11ThreadPool::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::C11ThreadPool&)::::]’: bbd_lt_invert_Cpp.cpp:85:26: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11ThreadPool]’ 85 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 86 | [&](int w) { | ~~~~~~~~~~~~ 87 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+kmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 88 | ig[w+kmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 89 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 90 | prod_mu2,prod_lambda2,xvec,yvec_minus_s,yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w+kmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | }); | ~~ bbd_lt_invert_Cpp.cpp:138:38: required from here 138 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 139 | maxdepth, nblocks, tol, loopC11ThreadPool); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:384:43: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 384 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Async::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::C11Async&)::]’: bbd_lt_invert_Cpp.cpp:51:18: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Async]’ 51 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(kmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 52 | [&](int w) { | ~~~~~~~~~~~~ 53 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 54 | ig[w].resize((A+1-a0)*Bp1); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 55 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)],prod_mu2,prod_lambda2,xvec,yvec_minus_s, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 56 | yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)],inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 57 | }); | ~~ bbd_lt_invert_Cpp.cpp:145:38: required from here 145 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 146 | maxdepth, nblocks, tol, loopC11Async); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:342:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 342 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:359:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 359 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Async::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, loops::C11Async&)::::]’: bbd_lt_invert_Cpp.cpp:85:26: required from ‘std::vector bbd_lt_invert_Cpp_impl(double, int, int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, double, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Async]’ 85 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 86 | [&](int w) { | ~~~~~~~~~~~~ 87 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+kmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 88 | ig[w+kmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 89 | bbd_lt_Cpp(s,a0,b0,lambda1,lambda2,mu2,gamma,A,Bp1,maxdepth,phi[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 90 | prod_mu2,prod_lambda2,xvec,yvec_minus_s,yvec[scheme.id(w)],lentz_plus_invBk1dBk[scheme.id(w)], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 91 | inv_Bk1dBk[scheme.id(w)],BidBj[scheme.id(w)],ig[w+kmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 | }); | ~~ bbd_lt_invert_Cpp.cpp:145:38: required from here 145 | return bbd_lt_invert_Cpp_impl(t, a0, b0, lambda1, lambda2, mu2, gamma, x, y, A, Bp1, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 146 | maxdepth, nblocks, tol, loopC11Async); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:342:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 342 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:359:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 359 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd_lt_invert_Cpp.cpp: In lambda function: bbd_lt_invert_Cpp.cpp:98:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 98 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bbd_lt_invert_Cpp.cpp:70:17: note: ‘sk1’ was declared here 70 | double sk,sk1; | ^~~ bbd_lt_invert_Cpp.cpp: In lambda function: bbd_lt_invert_Cpp.cpp:98:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 98 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bbd_lt_invert_Cpp.cpp:70:17: note: ‘sk1’ was declared here 70 | double sk,sk1; | ^~~ bbd_lt_invert_Cpp.cpp: In lambda function: bbd_lt_invert_Cpp.cpp:98:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 98 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bbd_lt_invert_Cpp.cpp:70:17: note: ‘sk1’ was declared here 70 | double sk,sk1; | ^~~ bbd_lt_invert_Cpp.cpp: In lambda function: bbd_lt_invert_Cpp.cpp:98:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 98 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bbd_lt_invert_Cpp.cpp:70:17: note: ‘sk1’ was declared here 70 | double sk,sk1; | ^~~ g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c inv_Bk1dBk_Cpp.cpp -o inv_Bk1dBk_Cpp.o bbd_lt_invert_Cpp.cpp: In lambda function: bbd_lt_invert_Cpp.cpp:98:19: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 98 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ bbd_lt_invert_Cpp.cpp:70:17: note: ‘sk1’ was declared here 70 | double sk,sk1; | ^~~ In file included from inv_Bk1dBk_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c lentz_plus_invBk1dBk_Cpp.cpp -o lentz_plus_invBk1dBk_Cpp.o In file included from lentz_plus_invBk1dBk_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c phi_Cpp.cpp -o phi_Cpp.o In file included from phi_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c prod_lambda2_Cpp.cpp -o prod_lambda2_Cpp.o In file included from prod_lambda2_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c prod_mu2_Cpp.cpp -o prod_mu2_Cpp.o In file included from prod_mu2_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c tb_lt_Cpp.cpp -o tb_lt_Cpp.o g++ -std=gnu++20 -I"/data/gannet/ripley/R/cxx20/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/RcppParallel/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c tb_lt_invert_Cpp.cpp -o tb_lt_invert_Cpp.o In file included from tb_lt_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture In file included from tb_lt_invert_Cpp.cpp:1: bbd.h: In lambda function: bbd.h:386:54: warning: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20 [-Wdeprecated] 386 | pool.enqueue([=] { | ^ bbd.h:386:54: note: add explicit ‘this’ or ‘*this’ capture bbd.h: In instantiation of ‘UnaryFunction loops::TbbThreads::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::TbbThreads&)::]’: tb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::TbbThreads]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ tb_lt_invert_Cpp.cpp:95:31: required from here 95 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | nblocks, tol, Lmax, loopTbbThreads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:260:29: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 260 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::TbbThreads::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::TbbThreads&)::::]’: tb_lt_invert_Cpp.cpp:60:38: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::TbbThreads]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ tb_lt_invert_Cpp.cpp:95:31: required from here 95 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 96 | nblocks, tol, Lmax, loopTbbThreads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:260:29: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 260 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Threads::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::C11Threads&)::]’: tb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Threads]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ tb_lt_invert_Cpp.cpp:104:31: required from here 104 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 105 | nblocks, tol, Lmax, loopC11Threads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:301:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 301 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:317:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 317 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Threads::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::C11Threads&)::::]’: tb_lt_invert_Cpp.cpp:60:38: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Threads]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ tb_lt_invert_Cpp.cpp:104:31: required from here 104 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 105 | nblocks, tol, Lmax, loopC11Threads); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:301:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 301 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:317:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 317 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11ThreadPool::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::C11ThreadPool&)::]’: tb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11ThreadPool]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ tb_lt_invert_Cpp.cpp:111:33: required from here 111 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 112 | nblocks, tol, Lmax, loopC11ThreadPool); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:384:43: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 384 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11ThreadPool::for_each(InputIt, InputIt, UnaryFunction) [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::C11ThreadPool&)::::]’: tb_lt_invert_Cpp.cpp:60:38: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11ThreadPool]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ tb_lt_invert_Cpp.cpp:111:33: required from here 111 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 112 | nblocks, tol, Lmax, loopC11ThreadPool); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:384:43: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 384 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Async::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::C11Async&)::]’: tb_lt_invert_Cpp.cpp:30:18: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Async]’ 30 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(Lmax), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 31 | [&](int w) { | ~~~~~~~~~~~~ 32 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 33 | ig[w].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~ 34 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 35 | }); | ~~ tb_lt_invert_Cpp.cpp:118:33: required from here 118 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 119 | nblocks, tol, Lmax, loopC11Async); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:342:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 342 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:359:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 359 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ bbd.h: In instantiation of ‘UnaryFunction loops::C11Async::for_each(InputIt, InputIt, UnaryFunction) const [with InputIt = boost::iterators::counting_iterator; UnaryFunction = tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, loops::C11Async&)::::]’: tb_lt_invert_Cpp.cpp:60:38: required from ‘std::vector tb_lt_invert_Cpp_impl(double, const std::vector&, const std::vector&, const std::vector&, int, int, int, int, int, double, int&, ParallelizationScheme&) [with ParallelizationScheme = loops::C11Async]’ 60 | scheme.for_each( boost::make_counting_iterator(0), boost::make_counting_iterator(nblocks), | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 61 | [&](int w) { | ~~~~~~~~~~~~ 62 | mytype::ComplexNumber s(AA/(2*t),double_PI*(w+Lmax+1)/t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 63 | ig[w+Lmax].resize(matsize); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 64 | tb_lt_Cpp(s,lambda1,lambda2,lambda3,Ap1,Bp1,Cp1,direction,yvec,ig[w+Lmax]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 65 | }); | ~~ tb_lt_invert_Cpp.cpp:118:33: required from here 118 | return tb_lt_invert_Cpp_impl(t, lambda1, lambda2, lambda3, Ap1, Bp1, Cp1, direction, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 119 | nblocks, tol, Lmax, loopC11Async); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bbd.h:342:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 342 | for (int i = 0; i < nThreads - 1; ++i, start += chunkSize) { | ~~^~~~~~~~~~~~~~ bbd.h:359:51: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long unsigned int’ [-Wsign-compare] 359 | for (int i = 0; i < nThreads - 1; ++i) { | ~~^~~~~~~~~~~~~~ tb_lt_invert_Cpp.cpp: In lambda function: tb_lt_invert_Cpp.cpp:71:31: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ tb_lt_invert_Cpp.cpp:47:29: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ tb_lt_invert_Cpp.cpp: In lambda function: tb_lt_invert_Cpp.cpp:71:31: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ tb_lt_invert_Cpp.cpp:47:29: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ tb_lt_invert_Cpp.cpp: In lambda function: tb_lt_invert_Cpp.cpp:71:31: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ tb_lt_invert_Cpp.cpp:47:29: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ tb_lt_invert_Cpp.cpp: In lambda function: tb_lt_invert_Cpp.cpp:71:31: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ tb_lt_invert_Cpp.cpp:47:29: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ tb_lt_invert_Cpp.cpp: In lambda function: tb_lt_invert_Cpp.cpp:71:31: warning: ‘sk1’ may be used uninitialized [-Wmaybe-uninitialized] 71 | res[i] = sk1*exp(AA/2); | ~~~^~~~~~~~~~ tb_lt_invert_Cpp.cpp:47:29: note: ‘sk1’ was declared here 47 | double sk,sk1; | ^~~ 'LdFlags' has not been needed since 2013 (!!) and may get removed in 2027. Please update your 'Makevars'. 'RcppLdFlags' has not been needed since 2013 (!!) and may get removed in 2027. Please update your 'Makevars'. g++ -std=gnu++20 -shared -L/usr/local/lib64 -o MultiBD.so BidBj_Cpp.o RcppExports.o SEIR_Cpp.o SIR_Cpp.o bb_lt_Cpp.o bb_lt_invert_Cpp.o bbd_lt_Cpp.o bbd_lt_invert_Cpp.o inv_Bk1dBk_Cpp.o lentz_plus_invBk1dBk_Cpp.o phi_Cpp.o prod_lambda2_Cpp.o prod_mu2_Cpp.o tb_lt_Cpp.o tb_lt_invert_Cpp.o 'LdFlags' has not been needed since 2013 (!!) and may get removed in 2027. Please update your 'Makevars'. 'RcppLdFlags' has not been needed since 2013 (!!) and may get removed in 2027. Please update your 'Makevars'. make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-CXX20/MultiBD/src' make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-CXX20/MultiBD/src' 'LdFlags' has not been needed since 2013 (!!) and may get removed in 2027. Please update your 'Makevars'. 'RcppLdFlags' has not been needed since 2013 (!!) and may get removed in 2027. Please update your 'Makevars'. make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-CXX20/MultiBD/src' installing to /data/gannet/ripley/R/packages/tests-CXX20/MultiBD.Rcheck/00LOCK-MultiBD/00new/MultiBD/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (MultiBD)