* installing *source* package 'fasano.franceschini.test' ...
** package 'fasano.franceschini.test' successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: 'g++.exe (GCC) 13.3.0'
using C++17
make[1]: Entering directory '/d/temp/2025_11_12_01_50_01_6119/RtmpukAShF/R.INSTALL195987e7c2cde/fasano.franceschini.test/src'
g++  -std=gnu++17 -I"D:/RCompile/recent/R-4.4.3/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/RcppParallel/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"  -DRCPP_PARALLEL_USE_TBB=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c ProgressBar.cpp -o ProgressBar.o
g++  -std=gnu++17 -I"D:/RCompile/recent/R-4.4.3/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/RcppParallel/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"  -DRCPP_PARALLEL_USE_TBB=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c RcppExports.cpp -o RcppExports.o
g++  -std=gnu++17 -I"D:/RCompile/recent/R-4.4.3/include" -DNDEBUG  -I'D:/RCompile/CRANpkg/lib/4.4/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.4/RcppParallel/include'   -I"d:/rtools44/x86_64-w64-mingw32.static.posix/include"  -DRCPP_PARALLEL_USE_TBB=1   -O2 -Wall  -mfpmath=sse -msse2 -mstackrealign  -c ff_internal_functions.cpp -o ff_internal_functions.o
In file included from ff_internal_functions.cpp:10:
distance.h: In function 'long int rangeDistance(const RTree&, const RTree&, std::size_t, std::size_t, const std::vector<double>&)':
distance.h:64:31: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long long unsigned int'} and 'int' [-Wsign-compare]
   64 |     for (std::size_t i = 0; i < (1 << ndim); ++i) {
      |                             ~~^~~~~~~~~~~~~
In file included from ff_internal_functions.cpp:8:
RangeTree.h: In instantiation of 'int RangeTree::RangeTree<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&, const std::vector<bool>&, const std::vector<bool>&) const [with T = double; S = int]':
distance.h:82:63:   required from here
RangeTree.h:1158:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
 1158 |             for (int i = 0; i < lower.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'std::vector<T> RangeTree::RangeTree<T, S>::getModifiedLower(const std::vector<T>&, const std::vector<bool>&) const [with T = double; S = int]':
RangeTree.h:1164:39:   required from 'int RangeTree::RangeTree<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&, const std::vector<bool>&, const std::vector<bool>&) const [with T = double; S = int]'
distance.h:82:63:   required from here
RangeTree.h:1085:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
 1085 |             for (int i = 0; i < lower.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'std::vector<T> RangeTree::RangeTree<T, S>::getModifiedUpper(const std::vector<T>&, const std::vector<bool>&) const [with T = double; S = int]':
RangeTree.h:1165:39:   required from 'int RangeTree::RangeTree<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&, const std::vector<bool>&, const std::vector<bool>&) const [with T = double; S = int]'
distance.h:82:63:   required from here
RangeTree.h:1102:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
 1102 |             for (int i = 0; i < upper.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'int RangeTree::RangeTreeNode<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&) const [with T = double; S = int]':
RangeTree.h:1164:38:   required from 'int RangeTree::RangeTree<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&, const std::vector<bool>&, const std::vector<bool>&) const [with T = double; S = int]'
distance.h:82:63:   required from here
RangeTree.h:741:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::RangeTreeNode<double, int>*, std::allocator<RangeTree::RangeTreeNode<double, int>*> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  741 |                 for (int i = 0; i < nodes.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~~
RangeTree.h:766:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::shared_ptr<RangeTree::RangeTreeNode<double, int> >, std::allocator<std::shared_ptr<RangeTree::RangeTreeNode<double, int> > > >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  766 |                 for (int i = 0; i < canonicalNodes.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~~
RangeTree.h:772:47: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  772 |                     } else if (compareInd + 1 == point->dim()) {
      |                                ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'bool RangeTree::RangeTreeNode<T, S>::pointInRange(const RangeTree::Point<T, S>&, const std::vector<T>&, const std::vector<T>&) const [with T = double; S = int]':
RangeTree.h:704:21:   required from 'int RangeTree::RangeTreeNode<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&) const [with T = double; S = int]'
RangeTree.h:1164:38:   required from 'int RangeTree::RangeTree<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&, const std::vector<bool>&, const std::vector<bool>&) const [with T = double; S = int]'
distance.h:82:63:   required from here
RangeTree.h:683:31: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  683 |             for (int i = 0; i < point.dim(); i++) {
      |                             ~~^~~~~~~~~~~~~
RangeTree.h: In instantiation of 'T RangeTree::Point<T, S>::operator[](int) const [with T = double; S = int]':
RangeTree.h:712:25:   required from 'int RangeTree::RangeTreeNode<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&) const [with T = double; S = int]'
RangeTree.h:1164:38:   required from 'int RangeTree::RangeTree<T, S>::countInRange(const std::vector<T>&, const std::vector<T>&, const std::vector<bool>&, const std::vector<bool>&) const [with T = double; S = int]'
distance.h:82:63:   required from here
RangeTree.h:157:35: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  157 |             if(index < 0 || index >= dim()) {
      |                             ~~~~~~^~~~~~~~
RangeTree.h: In instantiation of 'std::vector<std::shared_ptr<RangeTree::Point<T, S> > > RangeTree::RangeTree<T, S>::copyPointsToHeap(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]':
RangeTree.h:1126:72:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:1068:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::Point<double, int> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
 1068 |             for (int i = 0; i < points.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'std::vector<RangeTree::Point<T, S>*> RangeTree::RangeTree<T, S>::getRawPointers(std::vector<std::shared_ptr<RangeTree::Point<T, S> > >&) [with T = double; S = int]':
RangeTree.h:1127:75:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:1076:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::shared_ptr<RangeTree::Point<double, int> >, std::allocator<std::shared_ptr<RangeTree::Point<double, int> > > >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
 1076 |             for (int i = 0; i < points.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'RangeTree::SortedPointMatrix<T, S>::SortedPointMatrix(std::vector<RangeTree::Point<T, S>*>&) [with T = double; S = int]':
RangeTree.h:1128:36:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:344:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::Point<double, int>*, std::allocator<RangeTree::Point<double, int>*> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  344 |                 for (int i = 1; i < points.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~~~
RangeTree.h:345:42: warning: comparison of integer expressions of different signedness: 'long unsigned int' and 'int' [-Wsign-compare]
  345 |                     if (points[i]->dim() != dim) {
      |                         ~~~~~~~~~~~~~~~~~^~~~~~
RangeTree.h:360:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::Point<double, int>*, std::allocator<RangeTree::Point<double, int>*> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  360 |                 for (int i = 1; i < points.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'RangeTree::RangeTreeNode<T, S>::RangeTreeNode(RangeTree::SortedPointMatrix<T, S>&, bool, bool) [with T = double; S = int]':
RangeTree.h:1129:57:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:529:41: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  529 |                 if (spm.getCurrentDim() == point->dim() - 2) {
      |                     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
RangeTree.h:546:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::Point<double, int>*, std::allocator<RangeTree::Point<double, int>*> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  546 |                     for (int i = 0; i < allPointsSorted.size(); i++) {
      |                                     ~~^~~~~~~~~~~~~~~~~~~~~~~~
RangeTree.h:557:84: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  557 |                 }  else if (!onLeftEdge && !onRightEdge && spm.getCurrentDim() + 1 != point->dim()) {
      |                                                            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'bool RangeTree::PointOrdering<T, S>::less(const RangeTree::Point<T, S>&, const RangeTree::Point<T, S>&) const [with T = double; S = int]':
RangeTree.h:355:56:   required from 'RangeTree::SortedPointMatrix<T, S>::SortedPointMatrix(std::vector<RangeTree::Point<T, S>*>&) [with T = double; S = int]'
RangeTree.h:1128:36:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:253:35: warning: comparison of integer expressions of different signedness: 'const int' and 'long unsigned int' [-Wsign-compare]
  253 |             if (compareStartIndex >= p1.dim()) {
      |                 ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
RangeTree.h:256:47: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
  256 |             for (int i = compareStartIndex; i < p1.dim(); i++) {
      |                                             ~~^~~~~~~~~~
RangeTree.h: In instantiation of 'std::vector<int> RangeTree::SortedPointMatrix<T, S>::sortOrder(const std::vector<RangeTree::Point<T, S>*>&, int) [with T = double; S = int]':
RangeTree.h:374:50:   required from 'RangeTree::SortedPointMatrix<T, S>::SortedPointMatrix(std::vector<RangeTree::Point<T, S>*>&) [with T = double; S = int]'
RangeTree.h:1128:36:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:305:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::Point<double, int>*, std::allocator<RangeTree::Point<double, int>*> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  305 |             for (int i = 0; i < points.size(); i++) { order[i] = i; }
      |                             ~~^~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'void RangeTree::SortedPointMatrix<T, S>::rearrangeGivenOrder(std::vector<RangeTree::Point<T, S>*>&, const std::vector<int>&) [with T = double; S = int]':
RangeTree.h:376:25:   required from 'RangeTree::SortedPointMatrix<T, S>::SortedPointMatrix(std::vector<RangeTree::Point<T, S>*>&) [with T = double; S = int]'
RangeTree.h:1128:36:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:325:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::Point<double, int>*, std::allocator<RangeTree::Point<double, int>*> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  325 |             for (int i = 0; i < points.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'void RangeTree::SortedPointMatrix<T, S>::moveToNextDimension() [with T = double; S = int]':
RangeTree.h:530:44:   required from 'RangeTree::RangeTreeNode<T, S>::RangeTreeNode(RangeTree::SortedPointMatrix<T, S>&, bool, bool) [with T = double; S = int]'
RangeTree.h:1129:57:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:389:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<RangeTree::Point<double, int>*, std::allocator<RangeTree::Point<double, int>*> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  389 |                 for (int i = 0; i < pointsSortedByCurrentDim.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'std::pair<RangeTree::SortedPointMatrix<T, S>, RangeTree::SortedPointMatrix<T, S> > RangeTree::SortedPointMatrix<T, S>::splitOnMid() [with T = double; S = int]':
RangeTree.h:533:46:   required from 'RangeTree::RangeTreeNode<T, S>::RangeTreeNode(RangeTree::SortedPointMatrix<T, S>&, bool, bool) [with T = double; S = int]'
RangeTree.h:1129:57:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:448:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::vector<int> >::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  448 |                 for (int i = 0; i < redirectionTable.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~
RangeTree.h: In instantiation of 'std::vector<int> RangeTree::RangeTreeNode<T, S>::createGeqPointers(const std::vector<T>&, const std::vector<T>&) [with T = double; S = int]':
RangeTree.h:553:40:   required from 'RangeTree::RangeTreeNode<T, S>::RangeTreeNode(RangeTree::SortedPointMatrix<T, S>&, bool, bool) [with T = double; S = int]'
RangeTree.h:1129:57:   required from 'RangeTree::RangeTree<T, S>::RangeTree(const std::vector<RangeTree::Point<T, S> >&) [with T = double; S = int]'
distance.h:43:13:   required from 'std::vector<RangeTree::RangeTree<double, int> > buildRangeTrees(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:89:60:   required from 'long int testStatistic(const MatrixT&, std::size_t, std::size_t, const std::vector<long long unsigned int>&, char) [with MatrixT = RcppParallel::RMatrix<double>; std::size_t = long long unsigned int]'
ff_internal_functions.cpp:331:67:   required from here
RangeTree.h:569:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  569 |             for (int i = 0; i < vec.size(); i++) {
      |                             ~~^~~~~~~~~~~~
RangeTree.h:570:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<double>::size_type' {aka 'long long unsigned int'} [-Wsign-compare]
  570 |                 while (k < subVec.size() && subVec[k] < vec[i]) {
      |                        ~~^~~~~~~~~~~~~~~
g++ -shared -s -static-libgcc -o fasano.franceschini.test.dll tmp.def ProgressBar.o RcppExports.o ff_internal_functions.o -LD:/RCompile/CRANpkg/lib/4.4/RcppParallel/libs/x64 -lRcppParallel -LD:/RCompile/CRANpkg/lib/4.4/RcppParallel/lib/x64 -ltbb -ltbbmalloc -Ld:/rtools44/x86_64-w64-mingw32.static.posix/lib/x64 -Ld:/rtools44/x86_64-w64-mingw32.static.posix/lib -LD:/RCompile/recent/R-4.4.3/bin/x64 -lR
make[1]: Leaving directory '/d/temp/2025_11_12_01_50_01_6119/RtmpukAShF/R.INSTALL195987e7c2cde/fasano.franceschini.test/src'
make[1]: Entering directory '/d/temp/2025_11_12_01_50_01_6119/RtmpukAShF/R.INSTALL195987e7c2cde/fasano.franceschini.test/src'
make[1]: Leaving directory '/d/temp/2025_11_12_01_50_01_6119/RtmpukAShF/R.INSTALL195987e7c2cde/fasano.franceschini.test/src'
installing to d:/Rcompile/CRANpkg/lib/4.4/00LOCK-fasano.franceschini.test/00new/fasano.franceschini.test/libs/x64
** R
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
*** copying figures
** building package indices
** testing if installed package can be loaded from temporary location
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* MD5 sums
packaged installation of 'fasano.franceschini.test' as fasano.franceschini.test_2.2.2.zip
* DONE (fasano.franceschini.test)